A note on continuous-time online learning
In online learning, the data is provided in a sequential order, and the goal of the learner is to make online decisions to minimize overall regrets. This note is concerned with continuous-time models and algorithms for several online learning problems: online linear optimization, adversarial bandit, and adversarial linear bandit. For each problem, we extend the discrete-time algorithm to the continuous-time setting and provide a concise proof of the optimal regret bound.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
NTS-NOTEARS: Learning Nonparametric DBNs With Prior Knowledge
We describe NTS-NOTEARS, a score-based structure learning method for time-series data to learn dynamic Bayesian networks (DBNs) that captures nonlinear, lagged (inter-slice) and instantaneous (intra-slice) relations amon…
Time SeriesTime Series AnalysisIncremental Summarization for Customer Support via Progressive Note-Taking and Agent Feedback
We introduce an incremental summarization system for customer support agents that intelligently determines when to generate concise bullet notes during conversations, reducing agents' context-switching effort and redunda…
A Reference Governor for Nonlinear Systems with Disturbance Inputs Based on Logarithmic Norms and Quadratic Programming
This note describes a reference governor design for a continuous-time nonlinear system with an additive disturbance. The design is based on predicting the response of the nonlinear system by the response of a linear mode…
PredictionClinical-Coder: Assigning Interpretable ICD-10 Codes to Chinese Clinical Notes
In this paper, we introduce Clinical-Coder, an online system aiming to assign ICD codes to Chinese clinical notes. ICD coding has been a research hotspot of clinical medicine, but the interpretability of prediction hinde…
Decision MakingA two-phase-ACO algorithm for solving nonlinear optimization problems subjected to fuzzy relational equations
In this paper, we investigate nonlinear optimization problems whose constraints are defined as fuzzy relational equations (FRE) with max-min composition. Since the feasible solution set of the FRE is often a non-convex s…