Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales

Terms and Conditions

Twitter GitHub LinkedIn Bluesky Youtube

© 2026 ResearchTrend.AI, All rights reserved.

Home
Papers
2009.09249
Cited By

Recursive Experts: An Efficient Optimal Mixture of Learning Systems in
Dynamic Environments

Recursive Experts: An Efficient Optimal Mixture of Learning Systems in Dynamic Environments

19 September 2020

ArXiv (abs)PDF HTML

Papers citing "Recursive Experts: An Efficient Optimal Mixture of Learning Systems in Dynamic Environments"

16 / 16 papers shown

Sequential Linearithmic Time Optimal Unimodal Fitting When Minimizing
Univariate Linear Losses

Sequential Linearithmic Time Optimal Unimodal Fitting When Minimizing Univariate Linear Losses

144

0

0

04 Apr 2023

Formulation of Weighted Average Smoothing as a Projection of the Origin
onto a Convex Polytope

Formulation of Weighted Average Smoothing as a Projection of the Origin onto a Convex Polytope

102

0

0

19 Mar 2023

A 2-opt Algorithm for Locally Optimal Set Partition Optimization

A 2-opt Algorithm for Locally Optimal Set Partition Optimization

118

0

0

14 Mar 2023

Data Dependent Regret Guarantees Against General Comparators for Full or
Bandit Feedback

Data Dependent Regret Guarantees Against General Comparators for Full or Bandit Feedback

154

0

0

12 Mar 2023

$1D$ to $nD$: A Meta Algorithm for Multivariate Global Optimization via
Univariate Optimizers

1D

nD

: A Meta Algorithm for Multivariate Global Optimization via Univariate Optimizers

198

0

0

06 Sep 2022

Optimal Tracking in Prediction with Expert Advice

Optimal Tracking in Prediction with Expert Advice

Suleyman S. Kozat

120

1

0

07 Aug 2022

An Auto-Regressive Formulation for Smoothing and Moving Mean with
Exponentially Tapered Windows

An Auto-Regressive Formulation for Smoothing and Moving Mean with Exponentially Tapered Windows

131

1

0

29 Jun 2022

Second Order Regret Bounds Against Generalized Expert Sequences under
Partial Bandit Feedback

Second Order Regret Bounds Against Generalized Expert Sequences under Partial Bandit Feedback

137

1

0

13 Apr 2022

A Linearithmic Time Locally Optimal Algorithm for the Multiway Number
Partition Optimization

A Linearithmic Time Locally Optimal Algorithm for the Multiway Number Partition Optimization

141

2

0

10 Mar 2022

Smoothing with the Best Rectangle Window is Optimal for All Tapered
Rectangle Windows

Smoothing with the Best Rectangle Window is Optimal for All Tapered Rectangle Windows

125

4

0

06 Mar 2022

Near-Linear Time Algorithm with Near-Logarithmic Regret Per Switch for
Mixable/Exp-Concave Losses

Near-Linear Time Algorithm with Near-Logarithmic Regret Per Switch for Mixable/Exp-Concave Losses

84

1

0

28 Sep 2021

Generalized Translation and Scale Invariant Online Algorithm for
Adversarial Multi-Armed Bandits

Generalized Translation and Scale Invariant Online Algorithm for Adversarial Multi-Armed Bandits

124

2

0

19 Sep 2021

Efficient Locally Optimal Number Set Partitioning for Scheduling,
Allocation and Fair Selection

Efficient Locally Optimal Number Set Partitioning for Scheduling, Allocation and Fair Selection

114

4

0

10 Sep 2021

Nonparametric Extrema Analysis in Time Series for Envelope Extraction,
Peak Detection and Clustering

Nonparametric Extrema Analysis in Time Series for Envelope Extraction, Peak Detection and Clustering

87

13

0

05 Sep 2021

Optimal and Efficient Algorithms for General Mixable Losses against
Switching Oracles

Optimal and Efficient Algorithms for General Mixable Losses against Switching Oracles

92

10

0

13 Aug 2021

Universal Online Convex Optimization with Minimax Optimal Second-Order
Dynamic Regret

Universal Online Convex Optimization with Minimax Optimal Second-Order Dynamic Regret

Suleyman S. Kozat

133

1

0

30 Jun 2019