Kaiyi Ji

CoRR, 2024

Discriminative Adversarial Unlearning.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Lower Bounds and Accelerated Algorithms for Bilevel Optimization.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2023

Achieving O(ε<sup>-1.5</sup>) Complexity in Hessian/Jacobian-free Stochastic Bilevel Optimization.

[BibT_eX]

[DOI]

Yifan Yang

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

SimFBO: Towards Simple, Flexible and Communication-efficient Federated Bilevel Learning.

[BibT_eX]

[DOI]

Yifan Yang

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

Direction-oriented Multi-objective Learning: Simple and Provable Stochastic Algorithms.

[BibT_eX]

[DOI]

Hao Ban

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

Non-Convex Bilevel Optimization with Time-Varying Objective Functions.

[BibT_eX]

[DOI]

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

Bilevel Coreset Selection in Continual Learning: A New Formulation and Algorithm.

[BibT_eX]

[DOI]

Jie Hao

Mingrui Liu

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

Network Utility Maximization with Unknown Utility Functions: A Distributed, Data-Driven Bilevel Optimization Approach.

[BibT_eX]

[DOI]

Lei Ying

Proceedings of the Twenty-fourth International Symposium on Theory, 2023

Communication-Efficient Federated Hypergradient Computation via Aggregated Iterative Differentiation.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Achieving Linear Speedup in Non-IID Federated Bilevel Learning.

[BibT_eX]

[DOI]

Minhui Huang

Dewei Zhang

Proceedings of the International Conference on Machine Learning, 2023

2022

Theoretical Convergence of Multi-Step Model-Agnostic Meta-Learning.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2022

A Constrained Optimization Approach to Bilevel Optimization with Multiple Inner Minima.

[BibT_eX]

[DOI]

CoRR, 2022

Efficiently Escaping Saddle Points in Bilevel Optimization.

[BibT_eX]

[DOI]

CoRR, 2022

A new one-point residual-feedback oracle for black-box learning and control.

[BibT_eX]

[DOI]

Autom., 2022

Data sampling affects the complexity of online SGD over dependent data.

[BibT_eX]

[DOI]

Proceedings of the Uncertainty in Artificial Intelligence, 2022

On the Convergence Theory for Hessian-Free Bilevel Algorithms.

[BibT_eX]

[DOI]

Daouda Sow

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

Will Bilevel Optimizers Benefit from Loops.

[BibT_eX]

[DOI]

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

2021

Understanding Estimation and Generalization Error of Generative Adversarial Networks.

[BibT_eX]

[DOI]

Yi Zhou

IEEE Trans. Inf. Theory, 2021

ES-Based Jacobian Enables Faster Bilevel Optimization.

[BibT_eX]

[DOI]

Daouda Sow

CoRR, 2021

Bilevel Optimization for Machine Learning: Algorithm Design and Convergence Analysis.

[BibT_eX]

[DOI]

CoRR, 2021

Provably Faster Algorithms for Bilevel Optimization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Bilevel Optimization: Convergence Analysis and Enhanced Design.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Learning Latent Features With Pairwise Penalties in Low-Rank Matrix Completion.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2020

Provably Faster Algorithms for Bilevel Optimization and Applications to Meta-Learning.

[BibT_eX]

[DOI]

CoRR, 2020

Boosting One-Point Derivative-Free Online Optimization via Residual Feedback.

[BibT_eX]

[DOI]

CoRR, 2020

Improving the Convergence Rate of One-Point Zeroth-Order Optimization using Residual Feedback.

[BibT_eX]

[DOI]

CoRR, 2020

Multi-Step Model-Agnostic Meta-Learning: Convergence and Improved Algorithms.

[BibT_eX]

[DOI]

CoRR, 2020

Convergence of Meta-Learning with Task-Specific Adaptation over Partial Parameters.

[BibT_eX]

[DOI]

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

Proximal Gradient Algorithm with Momentum and Flexible Parameter Restart for Nonconvex Optimization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

History-Gradient Aided Batch Size Adaptation for Variance Reduced Algorithms.

[BibT_eX]

[DOI]

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

Robust Stochastic Bandit Algorithms under Probabilistic Unbounded Adversarial Attack.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Faster Stochastic Algorithms via History-Gradient Aided Batch Size Adaptation.

[BibT_eX]

[DOI]

CoRR, 2019

SpiderBoost and Momentum: Faster Variance Reduction Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Improved Zeroth-Order Variance Reduced Algorithms and Analysis for Nonconvex Optimization.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

2018

On Resource Pooling and Separation for LRU Caching.

[BibT_eX]

[DOI]

Proc. ACM Meas. Anal. Comput. Syst., 2018

SpiderBoost: A Class of Faster Variance-reduced Algorithms for Nonconvex Optimization.

[BibT_eX]

[DOI]

CoRR, 2018

Convergence of SGD in Learning ReLU Models with Separable Data.

[BibT_eX]

[DOI]

CoRR, 2018

Learning Latent Features with Pairwise Penalties in Matrix Completion.

[BibT_eX]

[DOI]

CoRR, 2018

Minimax Estimation of Neural Net Distance.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

LRU Caching with Dependent Competing Requests.

[BibT_eX]

[DOI]

Guocong Quan

Jian Tan

Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

Asymptotic Miss Ratio of LRU Caching with Consistent Hashing.

[BibT_eX]

[DOI]