default search action
Dario Azzimonti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Marco Zaffalon, Alessandro Antonucci
, Rafael Cabañas, David Huber, Dario Azzimonti:
Efficient computation of counterfactual bounds. Int. J. Approx. Reason. 171: 109111 (2024) - [j10]Lorenzo Zambon, Dario Azzimonti, Giorgio Corani:
Efficient probabilistic reconciliation of forecasts for real-valued and count time series. Stat. Comput. 34(1): 21 (2024) - [i12]Alessio Benavoli, Dario Azzimonti:
A tutorial on learning from preferences and choices with Gaussian Processes. CoRR abs/2403.11782 (2024) - 2023
- [j9]Manuel Schürch
Correlated product of experts for sparse Gaussian process regression. Mach. Learn. 112(5): 1411-1432 (2023) - [c9]Alessio Benavoli
Bayesian Optimization For Choice Data. GECCO Companion 2023: 2272-2279 - [c8]Alessio Benavoli, Dario Azzimonti, Dario Piga:
Learning Choice Functions with Gaussian Processes. UAI 2023: 141-151 - [i11]Alessio Benavoli, Dario Azzimonti, Dario Piga
Learning Choice Functions with Gaussian Processes. CoRR abs/2302.00406 (2023) - [i10]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas, David Huber, Dario Azzimonti:
Efficient Computation of Counterfactual Bounds. CoRR abs/2307.08304 (2023) - 2022
- [c7]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas, David Huber, Dario Azzimonti:
Bounding Counterfactuals under Selection Bias. PGM 2022: 289-300 - [i9]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas, David Huber, Dario Azzimonti:
Bounding Counterfactuals under Selection Bias. CoRR abs/2208.01417 (2022) - [i8]Lorenzo Zambon, Dario Azzimonti, Giorgio Corani:
Probabilistic reconciliation of forecasts via importance sampling. CoRR abs/2210.02286 (2022) - 2021
- [j8]Dario Azzimonti
Comparison of domain adaptation and active learning techniques for quality of transmission estimation with small-sized training datasets [Invited]. JOCN 13(1): A56-A66 (2021) - [j7]Alessio Benavoli
A unified framework for closed-form nonparametric regression, classification, preference and mixed problems with Skew Gaussian Processes. Mach. Learn. 110(11): 3095-3133 (2021) - [j6]Dario Azzimonti
Adaptive Design of Experiments for Conservative Estimation of Excursion Sets. Technometrics 63(1): 13-26 (2021) - [c6]Alessio Benavoli, Dario Azzimonti, Dario Piga
A Unified Framework for Closed-Form Nonparametric Regression, Classification, Preference and Mixed Problems with Skew Gaussian Processes. DSAA 2021: 1-2 - [c5]Alessio Benavoli, Dario Azzimonti
Preferential Bayesian optimisation with skew gaussian processes. GECCO Companion 2021: 1842-1850 - [c4]Lucas Kania
Sparse Information Filter for Fast Gaussian Process Regression. ECML/PKDD (3) 2021: 527-542 - [i7]Alessio Benavoli, Dario Azzimonti, Dario Piga:
Choice functions based multi-objective Bayesian optimisation. CoRR abs/2110.08217 (2021) - [i6]Manuel Schürch, Dario Azzimonti, Alessio Benavoli, Marco Zaffalon:
Correlated Product of Experts for Sparse Gaussian Process Regression. CoRR abs/2112.09519 (2021) - 2020
- [j5]Manuel Schürch
Recursive estimation for sparse Gaussian process regression. Autom. 120: 109127 (2020) - [j4]Dario Azzimonti
Reducing probes for quality of transmission estimation in optical networks with active learning. JOCN 12(1): A38-A48 (2020) - [j3]Alessio Benavoli
Skew Gaussian processes for classification. Mach. Learn. 109(9-10): 1877-1902 (2020) - [c3]Dario Azzimonti, Cristina Rottondi, Alessandro Giusti, Massimo Tornatore, Andrea Bianco:
Active vs Transfer Learning Approaches for QoT Estimation with Small Training Datasets. OFC 2020: 1-3 - [c2]Giorgio Corani, Dario Azzimonti
Probabilistic Reconciliation of Hierarchical Forecast via Bayes' Rule. ECML/PKDD (3) 2020: 211-226 - [i5]Alessio Benavoli, Dario Azzimonti, Dario Piga:
Skew Gaussian Processes for Classification. CoRR abs/2005.12987 (2020) - [i4]Dario Azzimonti, Manuel Schürch, Alessio Benavoli, Marco Zaffalon:
Orthogonally Decoupled Variational Fourier Features. CoRR abs/2007.06363 (2020) - [i3]Alessio Benavoli, Dario Azzimonti, Dario Piga:
Preferential Bayesian optimisation with Skew Gaussian Processes. CoRR abs/2008.06677 (2020) - [i2]Alessio Benavoli, Dario Azzimonti, Dario Piga:
A unified framework for closed-form nonparametric regression, classification, preference and mixed problems with Skew Gaussian Processes. CoRR abs/2012.06846 (2020)
2010 – 2019
- 2019
- [j2]Dario Azzimonti
Profile Extrema for Visualizing and Quantifying Uncertainties on Excursion Regions: Application to Coastal Flooding. Technometrics 61(4): 474-493 (2019) - [c1]Dario Azzimonti, Cristina Rottondi, Massimo Tornatore:
Using Active Learning to Decrease Probes for QoT Estimation in Optical Networks. OFC 2019: 1-3 - [i1]Manuel Schürch, Dario Azzimonti, Alessio Benavoli, Marco Zaffalon:
Recursive Estimation for Sparse Gaussian Process Regression. CoRR abs/1905.11711 (2019) - 2016
- [j1]Dario Azzimonti
Quantifying Uncertainties on Excursion Sets Under a Gaussian Random Field Prior. SIAM/ASA J. Uncertain. Quantification 4(1): 850-874 (2016)
Coauthor Index
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-08-05 20:19 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: