Peng Zhao

CoRR, 2024

Universal Online Convex Optimization with 1 Projection per Round.

[BibT_eX]

[DOI]

CoRR, 2024

Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation.

[BibT_eX]

[DOI]

CoRR, 2024

Handling Heterogeneous Curvatures in Bandit LQR Control.

[BibT_eX]

[DOI]

Jing Wang

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Learning with Adaptive Resource Allocation.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Efficient Non-stationary Online Learning by Wavelets with Applications to Online Distribution Shift Adaptation.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition.

[BibT_eX]

[DOI]

Long-Fei Li

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

Dynamic Regret of Adversarial MDPs with Unknown Transition and Linear Function Approximation.

[BibT_eX]

[DOI]

Long-Fei Li

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Non-stationary Online Learning with Memory and Non-stochastic Control.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2023

Online Non-stochastic Control with Partial Feedback.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2023

Universal Online Learning with Gradual Variations: A Multi-layer Online Ensemble Approach.

[BibT_eX]

[DOI]

CoRR, 2023

Stochastic Approximation Approaches to Group Distributionally Robust Optimization.

[BibT_eX]

[DOI]

CoRR, 2023

Adapting to Continuous Covariate Shift via Online Density Ratio Estimation.

[BibT_eX]

[DOI]

CoRR, 2023

Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Dynamic Regret of Adversarial Linear Mixture MDPs.

[BibT_eX]

[DOI]

Long-Fei Li

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Stochastic Approximation Approaches to Group Distributionally Robust Optimization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Fast Rates in Time-Varying Strongly Monotone Games.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Handling New Class in Online Label Shift.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Data Mining, 2023

Revisiting Weighted Strategy for Non-stationary Parametric Bandits.

[BibT_eX]

[DOI]

Jing Wang

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

Beyond Performative Prediction: Open-environment Learning with Presence of Corruptions.

[BibT_eX]

[DOI]

Jia-Wei Shan

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

Learning From Incomplete and Inaccurate Supervision.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2022

Improving Deep Forest by Screening.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2022

Adapting to Online Label Shift with Provable Guarantees.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Efficient Methods for Non-stationary Online Learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Dynamic Regret of Online Markov Decision Processes.

[BibT_eX]

[DOI]

Longfei Li

Proceedings of the International Conference on Machine Learning, 2022

No-Regret Learning in Time-Varying Zero-Sum Games.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Adaptive Bandit Convex Optimization with Heterogeneous Curvature.

[BibT_eX]

[DOI]

Haipeng Luo

Mengxiao Zhang

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Non-stationary Online Learning with Memory and Non-stochastic Control.

[BibT_eX]

[DOI]

Yu-Xiang Wang

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Distribution-Free One-Pass Learning.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2021

Bandit Convex Optimization in Non-stationary Environments.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2021

Non-stationary Linear Bandits Revisited.

[BibT_eX]

[DOI]

Lijun Zhang

CoRR, 2021

Improved Analysis for Dynamic Regret of Strongly Convex and Smooth Functions.

[BibT_eX]

[DOI]

Lijun Zhang

Proceedings of the 3rd Annual Conference on Learning for Dynamics and Control, 2021

Towards Enabling Learnware to Handle Unseen Jobs.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Storage Fit Learning with Feature Evolvable Streams.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Exploratory Machine Learning with Unknown Unknowns.

[BibT_eX]

[DOI]

Yu-Jie Zhang

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Handling concept drift via model reuse.

[BibT_eX]

[DOI]

Le-Wen Cai

Mach. Learn., 2020

A Simple Online Algorithm for Competing with Dynamic Comparators.

[BibT_eX]

[DOI]

Yu-Jie Zhang

Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, 2020

An Unbiased Risk Estimator for Learning with Augmented Classes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Dynamic Regret of Convex and Smooth Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Learning with Feature and Distribution Evolvable Streams.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

A Simple Approach for Non-stationary Linear Bandits.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

An Unbiased Risk Estimator for Learning with Augmented Classes.

[BibT_eX]

[DOI]

Yu-Jie Zhang

CoRR, 2019

Learning from Incomplete and Inaccurate Supervision.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Nearest Neighbor Ensembles: An Effective Method for Difficult Problems in Streaming Classification with Emerging New Classes.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Data Mining, 2019

2018

Improving Deep Forest by Confidence Screening.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Data Mining, 2018

Label Distribution Learning by Optimal Transport.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Dual Set Multi-Label Learning.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Distribution-Free One-Pass Learning.

[BibT_eX]

[DOI]

CoRR, 2017

Multi-View Matrix Completion for Clustering with Side Information.

[BibT_eX]

[DOI]

Yuan Jiang