Jinfeng Yi

Universal Online Convex Optimization Meets Second-order Bounds JMLR 2025 Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards NeurIPS 2023 FedAvg Converges to Zero Training Loss Linearly for Overparameterized Multi-Layer Neural Networks ICML 2023 Stochastic Graphical Bandits with Heavy-Tailed Rewards UAI 2023 Training Meta-Surrogate Model for Transferable Adversarial Attack AAAI 2023 A Simple yet Universal Strategy for Online Convex Optimization ICML 2022 Can Adversarial Training Be Manipulated By Non-Robust Features? NeurIPS 2022 How to Robustify Black-Box ML Models? A Zeroth-Order Optimization Perspective ICLR 2022 Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor NeurIPS 2022 Understanding Clipping for Federated Learning: Convergence and Client-Level Differential Privacy ICML 2022 With False Friends Like These, Who Can Notice Mistakes? AAAI 2022 Better Safe Than Sorry: Preventing Delusive Adversaries with Adversarial Training NeurIPS 2021 Fast Certified Robust Training with Short Warmup NeurIPS 2021 PFedAtt: Attention-based Personalized Federated Learning on Heterogeneous Clients ACML 2021 A Frank-Wolfe Framework for Efficient and Effective Adversarial Attacks AAAI 2020 Improving Adversarial Robustness Requires Revisiting Misclassified Examples ICLR 2020 Potential Passenger Flow Prediction: A Novel Study for Urban Transportation Development AAAI 2020 Provably Robust Metric Learning NeurIPS 2020 Seq2Sick: Evaluating the Robustness of Sequence-to-Sequence Models with Adversarial Examples AAAI 2020 AdvIT: Adversarial Frames Identifier Based on Temporal Consistency in Videos ICCV 2019 AutoZOOM: Autoencoder-Based Zeroth Order Optimization Method for Attacking Black-Box Neural Networks AAAI 2019 DTWNet: a Dynamic Time Warping Network NeurIPS 2019 Improving the Robustness of Deep Neural Networks via Adversarial Training with Triplet Loss IJCAI 2019 On the Convergence and Robustness of Adversarial Training ICML 2019 Query-Efficient Hard-label Black-box Attack: An Optimization-based Approach ICLR 2019 Similarity Preserving Representation Learning for Time Series Clustering IJCAI 2019 Symmetric Cross Entropy for Robust Learning With Noisy Labels ICCV 2019 Universal Stagewise Learning for Non-Convex Problems with Convergence on Averaged Solutions ICLR 2019 Adaptive Negative Curvature Descent with Applications in Non-convex Optimization NeurIPS 2018 Attacking Visual Language Grounding with Adversarial Examples: A Case Study on Neural Image Captioning ACL 2018 Diverse Few-Shot Text Classification with Multiple Metrics NAACL 2018 Evaluating the Robustness of Neural Networks: An Extreme Value Theory Approach ICLR 2018 Is Robustness the Cost of Accuracy? -- A Comprehensive Study on the Robustness of 18 Deep Image Classification Models ECCV 2018 Random Warping Series: A Random Features Method for Time-Series Embedding AISTATS 2018 Self-weighted Multiple Kernel Learning for Graph-based Clustering and Semi-supervised Classification IJCAI 2018 Improved Dynamic Regret for Non-degenerate Functions NeurIPS 2017 Scalable Demand-Aware Recommendation NeurIPS 2017 Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradient ICML 2016 A Single-Pass Algorithm for Efficiently Recovering Sparse Cluster Centers of High-dimensional Data ICML 2014 Efficient Algorithms for Robust One-bit Compressive Sensing ICML 2014 Online Kernel Learning with a Near Optimal Sparsity Bound ICML 2013 Semi-supervised Clustering by Input Pattern Assisted Pairwise Similarity Matrix Completion ICML 2013 Semi-Crowdsourced Clustering: Generalizing Crowd Labeling by Robust Distance Metric Learning NeurIPS 2012 Stochastic Gradient Descent with Only One Projection NeurIPS 2012