scientific article; zbMATH DE number 7625184
From MaRDI portal
Publication:5054630
Stéphane Gaïffas, Jaouad Mourtada
Publication date: 29 November 2022
Full work available at URL: https://arxiv.org/abs/1912.10784
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
logistic regressiondensity estimationstatistical learning theorymisspecified modelsimproper prediction
Related Items (3)
Minimax rates for conditional density estimation via empirical entropy ⋮ An elementary analysis of ridge regression with random design ⋮ Suboptimality of constrained least squares and improvements via non-linear predictors
Cites Work
- Performance of empirical risk minimization in linear aggregation
- The lower tail of random quadratic forms with applications to ordinary least squares
- Random design analysis of ridge regression
- Parametric estimation. Finite sample theory
- From \(\varepsilon\)-entropy to KL-entropy: analysis of minimum information complexity density estima\-tion
- Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
- Admissible predictive density estimation
- Learning by mirror averaging
- Logarithmic regret algorithms for online convex optimization
- A universal prior for integers and estimation by minimum description length
- Asymptotic methods in statistical decision theory
- A game of prediction with expert advice
- Minimum contrast estimators on sieves: Exponential bounds and rates of convergence
- The maximum likelihood prior
- The weighted majority algorithm
- Rates of convergence for minimum contrast estimators
- Jeffreys' prior is asymptotically least favorable under entropy risk
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- Information-theoretic determination of minimax rates of convergence
- Asymptotics in statistics. Some basic concepts.
- Relative expected instantaneous loss bounds
- Mixing strategies for density estimation.
- Statistical learning theory and stochastic optimization. Ecole d'Eté de Probabilitiés de Saint-Flour XXXI -- 2001.
- Probability inequalities for likelihood ratios and convergence rates of sieve MLEs
- Weak convergence and empirical processes. With applications to statistics
- Self-concordant analysis for logistic regression
- Exact minimax risk for linear least squares, and the lower tail of sample covariance matrices
- The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regression
- Finite-sample analysis of \(M\)-estimators using self-concordance
- Model selection by sequentially normalized least squares
- Asymptotically minimax Bayes predictive densities
- Optimal rates for the regularized least-squares algorithm
- Fast learning rates in statistical inference through aggregation
- Improved minimax predictive densities under Kullback-Leibler loss
- Nonsubjective priors via predictive relative entropy regret
- Learning without Concentration
- Adaptivity of averaged stochastic gradient descent to local strong convexity for logistic regression
- Positive Definite Matrices
- Online Learning and Online Convex Optimization
- Bounding the Smallest Singular Value of a Random Matrix Without Concentration
- On the Generalization Ability of On-Line Learning Algorithms
- Exact Minimax Strategies for Predictive Density Estimation, Data Compression, and Model Selection
- Robust Stochastic Approximation Approach to Stochastic Programming
- How Many Variables Should be Entered in a Regression Equation?
- On asymptotic properties of predictive distributions
- On the estimation of parametric density functions
- Goodness of prediction fit
- A Note on the Estimation of Probability Density Functions
- Distribution-free inequalities for the deleted and holdout error estimates
- Asymptotic Statistics
- Universal Portfolios
- An asymptotic property of model selection criteria
- Asymptotic minimax regret for data compression, gambling, and prediction
- Universal prediction
- Predictive fit for natural exponential families
- 10.1162/153244302760200704
- 10.1162/1532443041424300
- 10.1162/153244303321897690
- Competitive On-line Statistics
- Fisher information and stochastic complexity
- A modern maximum-likelihood theory for high-dimensional logistic regression
- Optimal errors and phase transitions in high-dimensional generalized linear models
- Upper and Lower Bounds for Stochastic Processes
- Prediction, Learning, and Games
- Elements of Information Theory
- STABILITY RESULTS IN LEARNING THEORY
- All of Nonparametric Statistics
- Statistical Decision Functions
- A Stochastic Approximation Method
- Introduction to Online Convex Optimization
- Maximum Likelihood Estimation of Misspecified Models
- The elements of statistical learning. Data mining, inference, and prediction
- Relative loss bounds for on-line density estimation with the exponential family of distributions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
