default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Zaffalon
- > Home > Persons > Marco Zaffalon
Publications
- 2023
[j60]Arianna Casanova
, Alessio Benavoli, Marco Zaffalon:
Nonlinear desirability as a linear classification problem. Int. J. Approx. Reason. 152: 1-32 (2023)- [j57]Manuel Schürch, Dario Azzimonti, Alessio Benavoli, Marco Zaffalon:
Correlated product of experts for sparse Gaussian process regression. Mach. Learn. 112(5): 1411-1432 (2023) - [c58]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Closure operators, classifiers and desirability. ISIPTA 2023: 25-36 - 2022
- [j54]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Quantum indistinguishability through exchangeability. Int. J. Approx. Reason. 151: 389-412 (2022) - 2021
- [c54]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Quantum Indistinguishability through Exchangeable Desirable Gambles. ISIPTA 2021: 22-31 - [c53]Arianna Casanova, Alessio Benavoli, Marco Zaffalon:
Nonlinear Desirability as a Linear Classification Problem. ISIPTA 2021: 61-71 - [c50]Giorgio Corani, Alessio Benavoli, Marco Zaffalon:
Time Series Forecasting with Gaussian Processes Needs Priors. ECML/PKDD (4) 2021: 103-117 - [i27]Manuel Schürch, Dario Azzimonti, Alessio Benavoli, Marco Zaffalon:
Correlated Product of Experts for Sparse Gaussian Process Regression. CoRR abs/2112.09519 (2021) - 2020
- [j50]Manuel Schürch, Dario Azzimonti, Alessio Benavoli, Marco Zaffalon:
Recursive estimation for sparse Gaussian process regression. Autom. 120: 109127 (2020) - [i26]Dario Azzimonti, Manuel Schürch, Alessio Benavoli, Marco Zaffalon:
Orthogonally Decoupled Variational Fourier Features. CoRR abs/2007.06363 (2020) - [i24]Giorgio Corani, Alessio Benavoli, João P. S. C. Augusto, Marco Zaffalon:
Automatic Forecasting using Gaussian Processes. CoRR abs/2009.08102 (2020) - 2019
- [j48]Alessio Benavoli, Alessandro Facchini, Dario Piga, Marco Zaffalon:
Sum-of-squares for bounded rationality. Int. J. Approx. Reason. 105: 130-152 (2019) - [c43]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Bernstein's Socks, Polynomial-Time Provable Coherence and Entanglement. ISIPTA 2019: 23-31 - [i22]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Computational Complexity and the Nature of Quantum Mechanics (Extended version). CoRR abs/1902.03513 (2019) - [i21]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Computational Complexity and the Nature of Quantum Mechanics. CoRR abs/1902.04569 (2019) - [i20]Manuel Schürch, Dario Azzimonti, Alessio Benavoli, Marco Zaffalon:
Recursive Estimation for Sparse Gaussian Process Regression. CoRR abs/1905.11711 (2019) - 2017
- [j43]Alessio Benavoli, Giorgio Corani, Janez Demsar, Marco Zaffalon:
Time for a Change: a Tutorial for Comparing Multiple Classifiers Through Bayesian Analysis. J. Mach. Learn. Res. 18: 77:1-77:36 (2017) - [j42]Giorgio Corani, Alessio Benavoli, Janez Demsar, Francesca Mangili, Marco Zaffalon:
Statistical comparison of classifiers through Bayesian hierarchical modelling. Mach. Learn. 106(11): 1817-1837 (2017) - [c39]Alessio Benavoli, Alessandro Facchini, Dario Piga, Marco Zaffalon:
SOS for Bounded Rationality. ISIPTA 2017: 25-36 - [c38]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon, José Vicente-Pérez:
A Polarity Theory for Sets of Desirable Gambles. ISIPTA 2017: 37-48 - 2016
- [c37]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Quantum Rational Preferences and Desirability. IDM@NIPS 2016: 87-96 - [i17]Alessio Benavoli, Marco Zaffalon:
State Space representation of non-stationary Gaussian Processes. CoRR abs/1601.01544 (2016) - [i15]Alessio Benavoli, Giorgio Corani, Janez Demsar, Marco Zaffalon:
Time for a change: a tutorial for comparing multiple classifiers through Bayesian analysis. CoRR abs/1606.04316 (2016) - [i14]Giorgio Corani, Alessio Benavoli, Janez Demsar, Francesca Mangili, Marco Zaffalon:
Statistical comparison of classifiers through Bayesian hierarchical modelling. CoRR abs/1609.08905 (2016) - 2015
- [c34]Alessio Benavoli, Giorgio Corani, Francesca Mangili, Marco Zaffalon:
A Bayesian nonparametric procedure for comparing algorithms. ICML 2015: 1264-1272 - [c32]Giorgio Corani, Alessio Benavoli, Francesca Mangili, Marco Zaffalon:
Bayesian Hypothesis Testing in Machine Learning. ECML/PKDD (3) 2015: 199-202 - 2014
- [c31]Alessio Benavoli, Giorgio Corani, Francesca Mangili, Marco Zaffalon, Fabrizio Ruggeri:
A Bayesian Wilcoxon signed-rank test based on the Dirichlet process. ICML 2014: 1026-1034 - 2011
- [j27]Alessio Benavoli, Marco Zaffalon, Enrique Miranda:
Robust Filtering Through Coherent Lower Previsions. IEEE Trans. Autom. Control. 56(7): 1567-1581 (2011) - 2009
- [c22]Alessio Benavoli, Marco Zaffalon, Enrique Miranda:
Reliable hidden Markov model filtering through coherent lower previsions. FUSION 2009: 1743-1750 - [c21]Alessandro Antonucci, Alessio Benavoli, Marco Zaffalon, Gert de Cooman, Filip Hermans:
Multiple model tracking by imprecise markov trees. FUSION 2009: 1767-1774
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
