The following pages link to Andrew R. Barron (Q1080262):
Displaying 38 items.
- Entropy and the central limit theorem (Q1080263) (← links)
- The strong ergodic theorem for densities: Generalized Shannon-McMillan- Breiman theorem (Q1086542) (← links)
- Uniformly powerful goodness of fit tests (Q1121617) (← links)
- Approximation of density functions by sequences of exponential families (Q1178945) (← links)
- (Q1291159) (redirect page) (← links)
- Risk bounds for model selection via penalization (Q1291160) (← links)
- Approximation and estimation bounds for artificial neural networks (Q1314507) (← links)
- Jeffreys' prior is asymptotically least favorable under entropy risk (Q1333128) (← links)
- A better approximation for balls (Q1577916) (← links)
- Information-theoretic determination of minimax rates of convergence (Q1578277) (← links)
- Information theory and superefficiency (Q1807151) (← links)
- Fisher information inequalities and the central limit theorem (Q1881640) (← links)
- The consistency of posterior distributions in nonparametric problems (Q1970478) (← links)
- Contribution to the theory of Pitman estimators (Q2253983) (← links)
- A note on weighted least square distribution fitting and full standardization of the empirical distribution function (Q2273028) (← links)
- Approximation and learning by greedy algorithms (Q2477053) (← links)
- Properties of Jeffreys Mixture for Markov Sources (Q2989473) (← links)
- Information-theoretic asymptotics of Bayes methods (Q3492635) (← links)
- Exact Minimax Strategies for Predictive Density Estimation, Data Compression, and Model Selection (Q3547248) (← links)
- Information Theory and Mixing Least-Squares Regressions (Q3548098) (← links)
- Generalized Entropy Power Inequalities and Monotonicity Properties of Information (Q3549075) (← links)
- A bound on the financial value of information (Q3813576) (← links)
- (Q3973919) (← links)
- Minimum complexity density estimation (Q3981153) (← links)
- Distribution estimation consistent in total variation and in two types of information divergence (Q4014167) (← links)
- Universal approximation bounds for superpositions of a sigmoidal function (Q4277151) (← links)
- Minimax redundancy for the class of memoryless sources (Q4340333) (← links)
- An asymptotic property of model selection criteria (Q4392438) (← links)
- Efficient Universal Portfolios for Past‐Dependent Target Classes (Q4409030) (← links)
- Asymptotic minimax regret for data compression, gambling, and prediction (Q4503538) (← links)
- (Q4510963) (← links)
- Approximation by Combinations of ReLU and Squared ReLU Ridge Functions With <inline-formula> <tex-math notation="LaTeX">$\ell^1$ </tex-math> </inline-formula> and <inline-formula> (Q4562132) (← links)
- The minimum description length principle in coding and modeling (Q4701208) (← links)
- Sparse Regression Codes (Q5228469) (← links)
- Least Squares Superposition Codes of Moderate Dictionary Size Are Reliable at Rates up to Capacity (Q5271929) (← links)
- Fast Sparse Superposition Codes Have Near Exponential Error Probability for <formula formulatype="inline"><tex Notation="TeX">$R&lt;{\cal C}$</tex></formula> (Q5346103) (← links)
- (Q5347959) (← links)
- Rapid Bayesian Computation and Estimation for Neural Networks via Log-Concave Coupling (Q6755310) (← links)
