Information-theoretic upper and lower bounds for statistical estimation
From MaRDI portal
(Redirected from Publication:3547876)
Recommendations
Cited in
(58)- Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity
- Sparse recovery in convex hulls via entropy penalization
- `Purposely misspecified' posterior inference on the volatility of a jump diffusion process
- A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation
- Contextuality of misspecification and data-dependent losses
- Adaptive Bayesian density estimation with location-scale mixtures
- Gibbs posterior inference on multivariate quantiles
- Gibbs posterior convergence and the thermodynamic formalism
- Model-free posterior inference on the area under the receiver operating characteristic curve
- Robust and rate-optimal Gibbs posterior inference on the boundary of a noisy image
- Fano's inequality for random variables
- Bayesian inference on volatility in the presence of infinite jump activity and microstructure noise
- On general Bayesian inference using loss functions
- Fast learning rates in statistical inference through aggregation
- Quasi-Bayesian analysis of nonparametric instrumental variables models
- Posterior concentration and fast convergence rates for generalized Bayesian learning
- Gibbs posterior concentration rates under sub-exponential type losses
- General inequalities for Gibbs posterior with nonadditive empirical risk
- On the properties of variational approximations of Gibbs posteriors
- Predicting Panel Data Binary Choice with the Gibbs Posterior
- scientific article; zbMATH DE number 3571306 (Why is no real title available?)
- A theory of learning with corrupted labels
- Risk minimization for time series binary choice with variable selection
- Chaining meets chain rule: multilevel entropic regularization and training of neural networks
- Minimum description length revisited
- Model misspecification, Bayesian versus credibility estimation, and Gibbs posteriors
- Asymptotic normality, concentration, and coverage of generalized posteriors
- Gibbs posterior inference on value-at-risk
- Learning Theory
- Learning with Limited Samples: Meta-Learning and Applications to Communication Systems
- A Bayesian approach to (online) transfer learning: theory and algorithms
- Robust posterior inference for Youden’s index cutoff
- Minimax rates for conditional density estimation via empirical entropy
- User-friendly Introduction to PAC-Bayes Bounds
- Joint production in stochastic non-parametric envelopment of data with firm-specific directions
- Adaptive variable selection for sequential prediction in multivariate dynamic models
- Approximating Bayes in the 21st century
- Gaussian variational approximations for high-dimensional state space models
- High-dimensional sparse classification using exponential weighting with empirical hinge loss
- Cutting feedback and modularized analyses in generalized Bayesian inference
- Computationally efficient variational-like approximations of possibilistic inferential models
- Advances in Bayesian model selection consistency for high-dimensional generalized linear models
- Loss-Based Variational Bayes Prediction
- Bayes meets Bernstein at the meta level: an analysis of fast rates in meta-learning with PAC-Bayes
- Misclassification bounds for PAC-Bayesian sparse deep learning
- Information-theoretic generalization bounds for transductive learning and its applications
- PAC-Chernoff bounds: understanding generalization in the interpolation regime
- Characterizing asymptotic dependence between a satellite precipitation product and station data in the Northern US Rocky Mountains via the tail dependence regression framework with a Gibbs posterior inference approach
- Generalized geographically weighted regression model within a modularized Bayesian framework
- Generalization bounds: perspectives from information theory and PAC-Bayes
- A tight excess risk bound via a unified PAC-Bayesian-Rademacher-Shtarkov-MDL complexity
- Sequential Gibbs posteriors with applications to principal component analysis
- A geometric modeling of Occam's razor in deep learning
- Generalized universal inference on risk minimizers
- Using the doubling dimension to analyze the generalization of learning algorithms
- Gibbs posterior for variable selection in high-dimensional classification and data mining
- A note on some algorithms for the Gibbs posterior
- The benefit of group sparsity
This page was built for publication: Information-theoretic upper and lower bounds for statistical estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547876)
