{"total":26,"rows":[{"id":"2110.14099","title":"Tight Concentrations and Confidence Sequences from the Regret of Universal Portfolio","created":"2021-10-27","cited_by_count":43,"area":null},{"id":"2412.19529","title":"Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping","created":"2024-12-27","cited_by_count":42,"area":null},{"id":"2407.18158","title":"Unlocking Tokens as Data Points for Generalization Bounds on Larger Language Models","created":"2024-07-25","cited_by_count":25,"area":null},{"id":"2310.18554","title":"Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion","created":"2023-10-28","cited_by_count":24,"area":null},{"id":"2402.13903","title":"Dealing with unbounded gradients in stochastic saddle-point optimization","created":"2024-02-21","cited_by_count":16,"area":null},{"id":"2102.09540","title":"Off-policy Confidence Sequences","created":"2021-02-18","cited_by_count":15,"area":null},{"id":"2305.19674","title":"Online-to-PAC Conversions: Generalization Bounds via Regret Analysis","created":"2023-05-31","cited_by_count":14,"area":null},{"id":"2311.09197","title":"A Unified Approach to Learning Ising Models: Beyond Independence and Bounded Width","created":"2023-11-15","cited_by_count":14,"area":null},{"id":"2302.05829","title":"Tighter PAC-Bayes Bounds Through Coin-Betting","created":"2023-02-12","cited_by_count":13,"area":null},{"id":"2504.16555","title":"Confidence Sequences for Generalized Linear Models via Regret Analysis","created":"2025-04-23","cited_by_count":10,"area":null},{"id":"2409.05284","title":"Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics","created":"2024-09-09","cited_by_count":8,"area":null},{"id":"2103.05907","title":"Linear Bandits on Uniformly Convex Sets","created":"2021-03-10","cited_by_count":6,"area":null},{"id":"2402.07341","title":"Noise-Adaptive Confidence Sets for Linear Bandits and Application to Bayesian Optimization","created":"2024-02-12","cited_by_count":6,"area":null},{"id":"2506.11848","title":"In Defense of Defensive Forecasting","created":"2025-06-13","cited_by_count":5,"area":null},{"id":"2102.05134","title":"Local and Global Uniform Convexity Conditions","created":"2021-02-09","cited_by_count":4,"area":null},{"id":"2402.09201","title":"Better-than-KL PAC-Bayes Bounds","created":"2024-02-14","cited_by_count":4,"area":null},{"id":"2602.24207","title":"The Stability of Online Algorithms in Performative Prediction","created":"2026-02-27","cited_by_count":4,"area":null},{"id":"2111.12786","title":"Differentially Private Nonparametric Regression Under a Growth Condition","created":"2021-11-24","cited_by_count":3,"area":null},{"id":"2410.08977","title":"Online-to-PAC generalization bounds under graph-mixing dependencies","created":"2024-10-11","cited_by_count":2,"area":null},{"id":"2505.18005","title":"Distances for Markov chains from sample streams","created":"2025-05-23","cited_by_count":2,"area":null},{"id":"2512.12325","title":"Eventually LIL Regret: Almost Sure $\\ln\\ln T$ Regret for a sub-Gaussian Mixture on Unbounded Data","created":"2025-12-13","cited_by_count":2,"area":null},{"id":"2405.11397","title":"Preparing for Black Swans: The Antifragility Imperative for Machine Learning","created":"2024-05-18","cited_by_count":1,"area":null},{"id":"2605.01628","title":"Self-Normalized Martingales and Uniform Regret Bounds for Linear Regression","created":"2026-05-02","cited_by_count":1,"area":null},{"id":"2602.03939","title":"C-IDS: Solving Contextual POMDP via Information-Directed Objective","created":"2026-02-03","cited_by_count":0,"area":null},{"id":"2602.06545","title":"Operationalizing Stein's Method for Online Linear Optimization: CLT-Based Optimal Tradeoffs","created":"2026-02-06","cited_by_count":0,"area":null},{"id":"2605.22124","title":"From Betting to Empirical Bernstein LIL","created":"2026-05-21","cited_by_count":0,"area":null}],"next_cursor":null}