scientific article; zbMATH DE number 7255087
From MaRDI portal
zbMath1498.68238arXiv1605.00252MaRDI QIDQ4969103
Nishant A. Mehta, Peter D. Grünwald
Publication date: 5 October 2020
Full work available at URL: https://arxiv.org/abs/1605.00252
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Density estimation (62G07) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Bayesian inference (62F15) Learning and adaptive systems in artificial intelligence (68T05) Statistical aspects of information-theoretic topics (62B10)
Related Items
Bayesian functional registration of fMRI activation maps, Posterior consistency for the spectral density of non‐Gaussian stationary time series, Generalized Bayes approach to inverse problems with model misspecification, Minimax rates for conditional density estimation via empirical entropy, Bernstein-von Mises theorem and misspecified models: a review, A comparison of learning rate selection methods in generalized Bayesian inference, User-friendly Introduction to PAC-Bayes Bounds, Relaxing the i.i.d. assumption: adaptively minimax optimal regret via root-entropic regularization, The no-free-lunch theorems of supervised learning, Gibbs posterior concentration rates under sub-exponential type losses, Gibbs posterior convergence and the thermodynamic formalism
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Empirical Bayes posterior concentration in sparse high-dimensional linear models
- The semiparametric Bernstein-von Mises theorem
- Rigorous learning curve bounds from statistical mechanics
- From \(\varepsilon\)-entropy to KL-entropy: analysis of minimum information complexity density estima\-tion
- Learning by mirror averaging
- Fast learning rates for plug-in classifiers
- Convergence rates of posterior distributions for non iid observations
- Minimum contrast estimators on sieves: Exponential bounds and rates of convergence
- Mutual information, metric entropy and cumulative relative entropy risk
- PAC-Bayesian stochastic model selection
- Information-theoretic determination of minimax rates of convergence
- Inconsistency of Bayesian inference for misspecified linear models, and a proposal for repairing it
- Relative deviation learning bounds and generalization with unbounded loss functions
- Bayesian fractional posteriors
- Model selection for Gaussian regression with random design
- Convergence rates of posterior distributions.
- Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory
- Optimal aggregation of classifiers in statistical learning.
- Probability inequalities for likelihood ratios and convergence rates of sieve MLEs
- Challenging the empirical mean and empirical variance: a deviation study
- The consistency of posterior distributions in nonparametric problems
- On aggregation for heavy-tailed classes
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
- Fast learning rates in statistical inference through aggregation
- Regularization, sparse recovery, and median-of-means tournaments
- Nonparametric Bayesian model selection and averaging
- Optimal learning with \textit{Q}-aggregation
- Empirical minimization
- Misspecification in infinite-dimensional Bayesian statistics
- Local Rademacher complexities
- On Bayesian Consistency
- Learning without Concentration
- $f$ -Divergence Inequalities
- Rényi Divergence and Kullback-Leibler Divergence
- The Safe Bayesian
- Information Consistency of Nonparametric Gaussian Process Methods
- Minimum complexity density estimation
- Efficient agnostic learning of neural networks with bounded fan-in
- An asymptotic property of model selection criteria
- A decision-theoretic extension of stochastic complexity and its applications to learning
- 10.1162/1532443041424300
- Robust Bayesian Inference via Coarsening
- A General Framework for Updating Belief Distributions
- Prediction, Learning, and Games
- Convex Analysis
- On Information and Sufficiency