English
Related papers

Related papers: Measurement-Feedback Control with Optimal Data-Dep…

200 papers

This paper presents early work aiming at the development of a new framework for the design and analysis of algorithms for online learning based prediction and control. Firstly, we consider the task of predicting values of a function or time…

Optimization and Control · Mathematics 2019-03-26 Jan-P. Calliess

We present a reduction from reinforcement learning (RL) to no-regret online learning based on the saddle-point formulation of RL, by which "any" online algorithm with sublinear regret can generate policies with provable performance…

Machine Learning · Computer Science 2020-01-03 Ching-An Cheng , Remi Tachet des Combes , Byron Boots , Geoff Gordon

The design of effective online caching policies is an increasingly important problem for content distribution networks, online social networks and edge computing services, among other areas. This paper proposes a new algorithmic toolbox for…

Networking and Internet Architecture · Computer Science 2022-10-21 Naram Mhaisen , George Iosifidis , Douglas Leith

We consider the problem of using observational bandit feedback data from multiple heterogeneous data sources to learn a personalized decision policy that robustly generalizes across diverse target settings. To achieve this, we propose a…

Machine Learning · Computer Science 2024-10-14 Aldo Gael Carranza , Susan Athey

Regret has been widely adopted as the metric of choice for evaluating the performance of online optimization algorithms for distributed, multi-agent systems. However, data/model variations associated with agents can significantly impact…

Machine Learning · Computer Science 2022-09-22 Zhanhong Jiang , Aditya Balu , Xian Yeow Lee , Young M. Lee , Chinmay Hegde , Soumik Sarkar

We tackle the problem of Non-stochastic Control (NSC) with the aim of obtaining algorithms whose policy regret is proportional to the difficulty of the controlled environment. Namely, we tailor the Follow The Regularized Leader (FTRL)…

Optimization and Control · Mathematics 2024-04-24 Naram Mhaisen , George Iosifidis

We enable efficient and effective coordination in unpredictable environments, i.e., in environments whose future evolution is unknown a priori and even adversarial. We are motivated by the future of autonomy that involves multiple robots…

Systems and Control · Electrical Eng. & Systems 2023-02-21 Zirui Xu , Hongyu Zhou , Vasileios Tzoumas

We study a two-sided market, wherein, price-sensitive heterogeneous customers and servers arrive and join their respective queues. A compatible customer-server pair can then be matched by the platform, at which point, they leave the system.…

Machine Learning · Computer Science 2025-10-17 Zixian Yang , Sushil Mahavir Varma , Lei Ying

The interaction between a vehicle navigation system and the driver of the vehicle can be formulated as a model-based reinforcement learning problem, where the navigation systems (agent) must quickly adapt to the characteristics of the…

Machine Learning · Computer Science 2022-04-06 Yuda Song , Ye Yuan , Wen Sun , Kris Kitani

This paper describes a new online convex optimization method which incorporates a family of candidate dynamical models and establishes novel tracking regret bounds that scale with the comparator's deviation from the best dynamical model in…

Machine Learning · Statistics 2013-01-08 Eric C. Hall , Rebecca M. Willett

We address online linear optimization problems when the possible actions of the decision maker are represented by binary vectors. The regret of the decision maker is the difference between her realized loss and the best loss she would have…

Machine Learning · Computer Science 2013-04-02 Jean-Yves Audibert , Sébastien Bubeck , Gábor Lugosi

We investigate online convex optimization in changing environments, and choose the adaptive regret as the performance measure. The goal is to achieve a small regret over every interval so that the comparator is allowed to change over time.…

Machine Learning · Computer Science 2019-06-18 Lijun Zhang , Tie-Yan Liu , Zhi-Hua Zhou

This work focuses on the setting of dynamic regret in the context of online learning with full information. In particular, we analyze regret bounds with respect to the temporal variability of the loss functions. By assuming that the…

Machine Learning · Computer Science 2021-02-16 Nicolò Campolongo , Francesco Orabona

We study the problem of system identification and adaptive control in partially observable linear dynamical systems. Adaptive and closed-loop system identification is a challenging problem due to correlations introduced in data collection.…

Machine Learning · Computer Science 2020-06-25 Sahin Lale , Kamyar Azizzadenesheli , Babak Hassibi , Anima Anandkumar

This paper considers the stability of online learning algorithms and its implications for learnability (bounded regret). We introduce a novel quantity called {\em forward regret} that intuitively measures how good an online learning…

Machine Learning · Computer Science 2012-11-28 Ankan Saha , Prateek Jain , Ambuj Tewari

In repeated interaction problems with adaptive agents, our objective often requires anticipating and optimizing over the space of possible agent responses. We show that many problems of this form can be cast as instances of online…

Machine Learning · Computer Science 2024-06-28 William Brown , Christos Papadimitriou , Tim Roughgarden

This paper addresses the problem of designing recommendation systems for social networks and e-commerce platforms from a control-theoretic perspective. We treat the design of recommendation systems as a state-feedback infinite-horizon…

Systems and Control · Electrical Eng. & Systems 2026-03-12 Simone Mariano , Paolo Frasca

A reliable controller is critical and essential for the execution of safe and smooth maneuvers of an autonomous vehicle.The controller must be robust to external disturbances, such as road surface, weather, and wind conditions, and so on.It…

Robotics · Computer Science 2019-05-01 Tianyu Shi , Pin Wang , Ching-Yao Chan , Chonghao Zou

We study online inverse linear optimization, also known as contextual recommendation, where a learner sequentially infers an agent's hidden objective vector from observed optimal actions over feasible sets that change over time. The learner…

Machine Learning · Computer Science 2026-05-13 Taihei Oki , Shinsaku Sakaue

A Multi-Agent Cooperative Learning (MACL) system is an artificial intelligence (AI) system where multiple learning agents work together to complete a common task. Recent empirical success of MACL systems in various domains (e.g. traffic…

Machine Learning · Computer Science 2023-10-31 Jialin Yi