Imagen de Portada

A Polynomial-time Algorithm for Online Sparse Linear Regression with Improved Regret Bound under Weaker Conditions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Li, Junfan, Liao, Shizhong, Xu, Zenglin, Nie, Liqiang
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Improved Kernel Alignment Regret Bound for Online Kernel Learning
por: Li, Junfan, et al.
Publicado: (2022)

Learnability in Online Kernel Selection with Memory Constraint via Data-dependent Regret Analysis
por: Li, Junfan, et al.
Publicado: (2024)

On the Necessity of Collaboration for Online Model Selection with Decentralized Data
por: Li, Junfan, et al.
Publicado: (2024)

Online Optimization for Learning to Communicate over Time-Correlated Channels
por: Wu, Zheshun, et al.
Publicado: (2024)

Trained Mamba Emulates Online Gradient Descent in In-Context Linear Regression
por: Jiang, Jiarui, et al.
Publicado: (2025)

Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound
por: Sakaue, Shinsaku, et al.
Publicado: (2025)

Follow The Approximate Sparse Leader for No-Regret Online Sparse Linear Approximation
por: Mukhopadhyay, Samrat, et al.
Publicado: (2025)

Self-Normalized Martingales and Uniform Regret Bounds for Linear Regression
por: Chen, Fan, et al.
Publicado: (2026)

A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming
por: Xu, Haoran, et al.
Publicado: (2026)

Comparator-Adaptive $Φ$-Regret: Improved Bounds, Simpler Algorithms, and Applications to Games
por: Hait, Soumita, et al.
Publicado: (2025)

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
por: Tajdini, Artin, et al.
Publicado: (2025)

Improved Regret Bounds for Online Fair Division with Bandit Learning
por: Schiffer, Benjamin, et al.
Publicado: (2025)

Topology Learning for Heterogeneous Decentralized Federated Learning over Unreliable D2D Networks
por: Wu, Zheshun, et al.
Publicado: (2023)

Data- and Variance-dependent Regret Bounds for Online Tabular MDPs
por: Li, Mingyi, et al.
Publicado: (2026)

Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
por: Oki, Taihei, et al.
Publicado: (2026)

Improved Regret of Linear Ensemble Sampling
por: Lee, Harin, et al.
Publicado: (2024)

Optimal Multitask Linear Regression and Contextual Bandits under Sparse Heterogeneity
por: Huang, Xinmeng, et al.
Publicado: (2023)

Regret Bounds for Episodic Risk-Sensitive Linear Quadratic Regulator
por: Xu, Wenhao, et al.
Publicado: (2024)

Gradient-Variation Regret Bounds for Unconstrained Online Learning
por: Zhao, Yuheng, et al.
Publicado: (2026)

Improved Regret Bounds for Bandits with Expert Advice
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2024)

Regret Bounds and Reinforcement Learning Exploration of EXP-based Algorithms
por: Xu, Mengfan, et al.
Publicado: (2020)

Improved Dynamic Regret for Online Frank-Wolfe
por: Wan, Yuanyu, et al.
Publicado: (2023)

Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion
por: Lee, Junghyun, et al.
Publicado: (2023)

DARC: Disagreement-Aware Alignment via Risk-Constrained Decoding
por: Zou, Mingxi, et al.
Publicado: (2026)

Online-to-PAC Conversions: Generalization Bounds via Regret Analysis
por: Lugosi, Gábor, et al.
Publicado: (2023)

Instance-Dependent Regret Bounds for Nonstochastic Linear Partial Monitoring
por: Di Gennaro, Federico, et al.
Publicado: (2025)

On Improved Regret Bounds In Bayesian Optimization with Gaussian Noise
por: Wang, Jingyi, et al.
Publicado: (2024)

Stochastic Online Instrumental Variable Regression: Regrets for Endogeneity and Bandit Feedback
por: Della Vecchia, Riccardo, et al.
Publicado: (2023)

PAC-Bayes Bounds for Multivariate Linear Regression and Linear Autoencoders
por: Guo, Ruixin, et al.
Publicado: (2025)

Logarithmic Regret and Polynomial Scaling in Online Multi-step-ahead Prediction
por: Qian, Jiachen, et al.
Publicado: (2025)

Improved Regret Bounds for Gaussian Process Upper Confidence Bound in Bayesian Optimization
por: Iwazaki, Shogo
Publicado: (2025)

Sparse Linear Regression and Lattice Problems
por: Gupte, Aparna, et al.
Publicado: (2024)

Adaptive Variance Reduction for Stochastic Optimization under Weaker Assumptions
por: Jiang, Wei, et al.
Publicado: (2024)

No-Regret Linear Bandits under Gap-Adjusted Misspecification
por: Liu, Chong, et al.
Publicado: (2025)

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
por: Réveillard, William, et al.
Publicado: (2025)

Online Forgetting Process for Linear Regression Models
por: Li, Yuantong, et al.
Publicado: (2020)

Online Prediction of Stochastic Sequences with High Probability Regret Bounds
por: Frey, Matthias, et al.
Publicado: (2026)

Optimal Algorithms in Linear Regression under Covariate Shift: On the Importance of Precondition
por: Liu, Yuanshi, et al.
Publicado: (2025)

Variance-Dependent Regret Bounds for Non-stationary Linear Bandits
por: Wang, Zhiyong, et al.
Publicado: (2024)

Regret Lower Bounds for Learning Linear Quadratic Gaussian Systems
por: Ziemann, Ingvar, et al.
Publicado: (2022)