ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Online learning”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGstat.MLRecentJun 2, 2026

Online Learning with Gradient-Variation Interval Regret

Yan-Feng Xie, Shuche Wang, Peng Zhao, Zhi-Hua Zhou

The paper proposes a novel online learning algorithm that achieves an interval regret bound scaling with gradient variation, providing strong theoretical guarantees for non-stationary environments.

View →
cs.LGeess.SPEmpiricalRecentJun 29, 2026

Hybrid Active-Online Learning Framework for Label-Efficient Concept Drift Adaptation in Optical Network Failure Detection

Yousuf Moiz Ali, Jaroslaw E. Prilepsky, João Pedro, Sasipim Srivallapanondh +3 more

A hybrid active-online learning framework is proposed for label-efficient concept drift adaptation in optical network failure detection, achieving high accuracy and AUC scores with minimal samples and…

View →
cs.AIRecentMay 27, 2026

Efficient Post-training of LLMs for Code Generation With Offline Reinforcement Learning

Mingze Wu, Abhinav Anand, Shweta Verma, Mira Mezini

This paper proposes using offline reinforcement learning (RL) as an efficient alternative to online RL for post-training code-generating LLMs, demonstrating its effectiveness, especially for smaller m…

View →
cs.LGcs.AIcs.CLRecentMay 29, 2026

OrcaRouter: A Production-Oriented LLM Router with Hybrid Offline-Online Learning

Zhenghua Bao, Fengya Tian, Chris Zhang, Zhenjun Chen +2 more

OrcaRouter is a production-ready LLM router that uses a hybrid offline-online learning approach to efficiently select the best large language model for an incoming query, achieving high accuracy at lo…

View →
stat.MLcs.LGTheoreticalRecentJul 19, 2026

Non-Asymptotic Best Policy Identification Guarantees in Online Reinforcement Learning

Joseph Lazzaro, Alessio Russo, Aldo Pacchiano

This paper provides non-asytotic sample complexity guarantees for the Navigate and Stop algorithm in online tabular Reinforcement Learning, identifying additional attributes that affect the overall sa…

View →
cs.NEEmpiricalRecentJun 12, 2026

A Programmer's Guide to Cascaded Adaptive Combiners: Online Learning by Biologically Accurate Models of Multilayer Neuron Networks

Martin Nilsson, Denis Kleyko

This paper introduces a mechanistic neuronal network model for multilayer learning, offering biological insights and an alternative to backpropagation.

View →
cs.AIRecentJun 1, 2026

TRON: Targeted Rule-Verifiable Online Environments for Visual Reasoning RL

Tianze Yang, Yucheng Shi, Ruitong Sun, Jingyuan Huang +2 more

The paper introduces TRON, an online, rule-verifiable environment substrate that generates an unbounded stream of fresh, controllable visual reasoning training instances, significantly improving RL pe…

View →
cs.DMTheoreticalRecentJun 27, 2026

Learning Unions of Intersecting Affine Modules in One Dimension with Queries

Eva González, Montserrat Hermo, Anthony Lin

This paper shows that finite unions of intersecting affine modules in one dimension are efficiently exactly learnable using equivalence and subset queries.

View →
cs.CYcs.AIRecentMay 31, 2026

Beyond Access: Guided LLM Scaffolding for Independent Learning in Undergraduate Statistics

Mohammad Amanlou, Yasaman Amou-Jafari, Mehrad Livian, Fatemeh Boloukazari +2 more

This study compares different levels of LLM access in a statistics course, finding that structured, guided use significantly improves students' reasoning skills and independent learning compared to un…

View →
stat.MLcs.AIcs.LGRecentMay 29, 2026

Correcting Split Selection in Online Decision Trees via Anytime-Valid Inference

Salim I. Amoukou, Saumitra Mishra, Manuela Veloso

The paper introduces a new anytime-valid inference method to correct split selection in online decision trees, providing robust statistical guarantees for streaming data that existing methods lack.

View →
cs.LGmath.OCstat.MLTheoreticalRecentJul 20, 2026

Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles

Haichen Hu, David Simchi-Levi

This paper shows that stochastic nonconvex optimization can be reduced to ordinary static regret minimization in online convex optimization, and establishes convergence rates for smooth and Lipschitz…

View →
cs.LGcs.AIRecentMay 31, 2026

What Makes a Strong Model? A Unified Spectral Analysis of Knowledge Transfer over High-dimensional Linear Regression

Wendao Wu, Fangqing Zhang, Haihan Zhang, Cong Fang

This paper develops a unified spectral analysis framework to explain how knowledge transfer (KT) works across different machine learning regimes, such as Knowledge Distillation and Weak-to-Strong gene…

View →
cs.AIcs.IRRecentMay 27, 2026

From Learning Resources to Competencies: LLM-Based Tagging with Evidence and Graph Constraints

Ngoc Luyen Le, Marie-Hélène Abel, Bertrand Laforge

The paper introduces an LLM-based pipeline that tags learning resources with structured competencies, achieving strong performance while providing traceable evidence and leveraging graph constraints.

View →
cs.CYcs.AIcs.LGEmpiricalRecentJul 21, 2026

Assessment in Team Problem-Solving Exercises in Computing Education

Valdemar Švábenský, Jan Vykopal, Sukrit Leelaluk, Pavel Čeleda +2 more

This paper compares two methods for assessing student teams in tabletop exercises using data from learning platforms and evaluates their validity and reliability.

View →
cs.AIcs.CLcs.HCRecentMay 28, 2026

Surfacing Isolated Learners with Outcome-Independent Mediation of Feedback between Teachers and Students Using AI

Junsoo Park, Youssef Medhat, Htet Phyo Wai, Ploy Thajchayapong +1 more

The paper proposes an interpretable, AI-driven decision layer that ranks course topics needing attention using multiple student and teacher signals, successfully identifying learning gaps before forma…

View →
cs.DSTheoreticalRecentJul 8, 2026

Stochastic Online Euclidean TSP

Daniel Anker Hermansen

This paper presents a deterministic algorithm achieving an expected competitive ratio of O(1) for Euclidean online TSP in high dimensions and O(log n) for d = 1, improving upon previous O(sqrt(n)) and…

View →