Quanquan Gu

Orcid: 0000-0001-9830-793X

According to our database1, Quanquan Gu authored at least 287 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the Convergence of Adaptive Gradient Methods for Nonconvex Optimization.
Trans. Mach. Learn. Res., 2024

Accelerated Preference Optimization for Large Language Model Alignment.
CoRR, 2024

LLaVA-Critic: Learning to Evaluate Multimodal Models.
CoRR, 2024

Convergence of Score-Based Discrete Diffusion Models: A Discrete-Time Analysis.
CoRR, 2024

General Preference Modeling with Preference Representations for Aligning Language Models.
CoRR, 2024

ProteinBench: A Holistic Evaluation of Protein Foundation Models.
CoRR, 2024

Relative-Translation Invariant Wasserstein Distance.
CoRR, 2024

Decomposed Direct Preference Optimization for Structure-Based Drug Design.
CoRR, 2024

Self-Play Preference Optimization for Language Model Alignment.
CoRR, 2024

Matching the Statistical Query Lower Bound for k-sparse Parity Problems with Stochastic Gradient Descent.
CoRR, 2024

Guided Discrete Diffusion for Electronic Health Record Generation.
CoRR, 2024

Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback.
CoRR, 2024

Settling Constant Regrets in Linear Markov Decision Processes.
CoRR, 2024

Antigen-Specific Antibody Design via Direct Energy-based Preference Optimization.
CoRR, 2024

Self-Play Fine-Tuning of Diffusion Models for Text-to-Image Generation.
CoRR, 2024

Reinforcement Learning from Human Feedback with Active Queries.
CoRR, 2024

Mitigating Object Hallucination in Large Vision-Language Models via Classifier-Free Guidance.
CoRR, 2024

TrustLLM: Trustworthiness in Large Language Models.
CoRR, 2024

Causal Graph ODE: Continuous Treatment Effect Modeling in Multi-agent Dynamical Systems.
Proceedings of the ACM on Web Conference 2024, 2024

Uncertainty-Aware Reward-Free Exploration with General Function Approximation.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Towards Robust Model-Based Reinforcement Learning Against Adversarial Corruption.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Borda Regret Minimization for Generalized Linear Dueling Bandits.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Diffusion Language Models Are Versatile Protein Learners.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Protein Conformation Generation via Force-Guided SE(3) Diffusion Models.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Feel-Good Thompson Sampling for Contextual Dueling Bandits.
Proceedings of the Forty-first International Conference on Machine Learning, 2024


Self-Play Fine-Tuning Converts Weak Language Models to Strong Language Models.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

DecompOpt: Controllable and Decomposed Diffusion Models for Structure-based Molecular Optimization.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

How Many Pretraining Tasks Are Needed for In-Context Learning of Linear Regression?
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Risk Bounds of Accelerated SGD for Overparameterized Linear Regression.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Horizon-free Reinforcement Learning in Adversarial Linear Mixture MDPs.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Pessimistic Nonlinear Least-Squares Value Iteration for Offline Reinforcement Learning.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Variance-aware Regret Bounds for Stochastic Contextual Dueling Bandits.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Understanding Transferable Representation Learning and Zero-shot Transfer in CLIP.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Large Language Models Can Be Contextual Privacy Protection Learners.
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing, 2024

2023
Benign Overfitting of Constant-Stepsize SGD for Linear Regression.
J. Mach. Learn. Res., 2023

Fast Sampling via De-randomization for Discrete Diffusion Models.
CoRR, 2023

A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation.
CoRR, 2023

Rephrase and Respond: Let Large Language Models Ask Better Questions for Themselves.
CoRR, 2023

Pure Exploration in Asynchronous Federated Bandits.
CoRR, 2023

Diffusion Language Models Can Perform Many Tasks with Scaling and Instruction-Finetuning.
CoRR, 2023

Beyond One-Model-Fits-All: A Survey of Domain Specialization for Large Language Models.
CoRR, 2023

Borda Regret Minimization for Generalized Linear Dueling Bandits.
CoRR, 2023

Benign Overfitting for Two-layer ReLU Networks.
CoRR, 2023

Learning High-Dimensional Single-Neuron ReLU Networks with Finite Samples.
CoRR, 2023

Provably efficient representation selection in Low-rank Markov Decision Processes: from online to offline RL.
Proceedings of the Uncertainty in Artificial Intelligence, 2023

Uniform-PAC Guarantees for Model-Based RL with Bounded Eluder Dimension.
Proceedings of the Uncertainty in Artificial Intelligence, 2023

Benign Overfitting in Adversarially Robust Linear Classification.
Proceedings of the Uncertainty in Artificial Intelligence, 2023

Efficient Privacy-Preserving Stochastic Nonconvex Optimization.
Proceedings of the Uncertainty in Artificial Intelligence, 2023

Optimal Extragradient-Based Algorithms for Stochastic Variational Inequalities with Separable Structure.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Corruption-Robust Offline Reinforcement Learning with General Function Approximation.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Implicit Bias of Gradient Descent for Two-layer ReLU and Leaky ReLU Networks on Nearly-orthogonal Data.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Robust Learning with Progressive Data Expansion Against Spurious Correlation.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Why Does Sharpness-Aware Minimization Generalize Better Than SGD?
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

The Benefits of Mixup for Feature Learning.
Proceedings of the International Conference on Machine Learning, 2023

Structure-informed Language Models Are Protein Designers.
Proceedings of the International Conference on Machine Learning, 2023

Optimal Online Generalized Linear Regression with Stochastic Noise and Its Application to Heteroscedastic Bandits.
Proceedings of the International Conference on Machine Learning, 2023

Optimal Horizon-Free Reward-Free Exploration for Linear Mixture MDPs.
Proceedings of the International Conference on Machine Learning, 2023

On the Interplay Between Misspecification and Sub-optimality Gap in Linear Contextual Bandits.
Proceedings of the International Conference on Machine Learning, 2023

Corruption-Robust Algorithms with Uncertainty Weighting for Nonlinear Contextual Bandits and Markov Decision Processes.
Proceedings of the International Conference on Machine Learning, 2023

Personalized Federated Learning under Mixture of Distributions.
Proceedings of the International Conference on Machine Learning, 2023

Finite-Sample Analysis of Learning High-Dimensional Single ReLU Neuron.
Proceedings of the International Conference on Machine Learning, 2023

Cooperative Multi-Agent Reinforcement Learning: Asynchronous Communication and Linear Function Approximation.
Proceedings of the International Conference on Machine Learning, 2023

Nesterov Meets Optimism: Rate-Optimal Separable Minimax Optimization.
Proceedings of the International Conference on Machine Learning, 2023

Benign Overfitting in Two-layer ReLU Convolutional Neural Networks.
Proceedings of the International Conference on Machine Learning, 2023

Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes.
Proceedings of the International Conference on Machine Learning, 2023

DecompDiff: Diffusion Models with Decomposed Priors for Structure-Based Drug Design.
Proceedings of the International Conference on Machine Learning, 2023

Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path.
Proceedings of the International Conference on Machine Learning, 2023

Understanding Train-Validation Split in Meta-Learning with Neural Networks.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Understanding the Generalization of Adam in Learning Neural Networks with Proper Regularization.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

How Does Semi-supervised Learning with Pseudo-labelers Work? A Case Study.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

A General Framework for Sample-Efficient Function Approximation in Reinforcement Learning.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Variance-Dependent Regret Bounds for Linear Bandits and Reinforcement Learning: Adaptivity and Computational Efficiency.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

The Implicit Bias of Batch Normalization in Linear Models and Two-layer Linear Convolutional Neural Networks.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
A General Framework for Sample-Efficient Function Approximation in Reinforcement Learning.
CoRR, 2022

Learning Two-Player Mixture Markov Games: Kernel Function Approximation and Correlated Equilibrium.
CoRR, 2022

Towards Understanding Mixture of Experts in Deep Learning.
CoRR, 2022

Bandit Learning with General Function Classes: Heteroscedastic Noise and Variance-dependent Regret Bounds.
CoRR, 2022

Benign Overfitting in Two-layer Convolutional Neural Networks.
CoRR, 2022

Learning Contextual Bandits Through Perturbed Rewards.
CoRR, 2022

Risk Bounds of Multi-Pass SGD for Least Squares in the Interpolation Regime.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

The Power and Limitation of Pretraining-Finetuning for Linear Regression under Covariate Shift.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Active Ranking without Strong Stochastic Transitivity.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Learning Two-Player Markov Games: Neural Function Approximation and Correlated Equilibrium.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Towards Understanding the Mixture-of-Experts Layer in Deep Learning.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Benign Overfitting in Two-layer Convolutional Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Dimension-free Complexity Bounds for High-order Nonconvex Finite-sum Optimization.
Proceedings of the International Conference on Machine Learning, 2022

Last Iterate Risk Bounds of SGD with Decaying Stepsize for Overparameterized Linear Regression.
Proceedings of the International Conference on Machine Learning, 2022

Learning Stochastic Shortest Path with Linear Function Approximation.
Proceedings of the International Conference on Machine Learning, 2022

On the Sample Complexity of Learning Infinite-horizon Discounted Linear Kernel MDPs.
Proceedings of the International Conference on Machine Learning, 2022

On the Convergence of Certified Robust Training with Interval Bound Propagation.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Learning Neural Contextual Bandits through Perturbed Rewards.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Neural Contextual Bandits with Deep Representation and Shallow Exploration.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Machine-Learning-based Predictive Control of Nonlinear Processes with Uncertainty.
Proceedings of the American Control Conference, 2022

Almost Optimal Algorithms for Two-player Zero-Sum Linear Mixture Markov Games.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

Faster Perturbed Stochastic Gradient Methods for Finding Local Minima.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

Nearly Minimax Optimal Regret for Learning Infinite-horizon Average-reward MDPs with Linear Function Approximation.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise Comparisons.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Near-optimal Policy Optimization Algorithms for Learning Adversarial Linear Mixture MDPs.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Self-training Converts Weak Learners to Strong Learners in Mixture Models.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Locally Differentially Private Reinforcement Learning for Linear Mixture Markov Decision Processes.
Proceedings of the Asian Conference on Machine Learning, 2022

Efficient Robust Training via Backward Smoothing.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Laplacian Smoothing Stochastic Gradient Markov Chain Monte Carlo.
SIAM J. Sci. Comput., 2021

Revisiting Membership Inference Under Realistic Assumptions.
Proc. Priv. Enhancing Technol., 2021

Linear Contextual Bandits with Adversarial Corruptions.
CoRR, 2021

Adaptive Differentially Private Empirical Risk Minimization.
CoRR, 2021

Provably Efficient Representation Learning in Low-rank Markov Decision Processes.
CoRR, 2021

Batched Neural Bandits.
CoRR, 2021

Nearly Optimal Regret for Learning Adversarial MDPs with Linear Function Approximation.
CoRR, 2021

Almost Optimal Algorithms for Two-player Markov Games with Linear Function Approximation.
CoRR, 2021

Faster Convergence of Stochastic Gradient Langevin Dynamics for Non-Log-Concave Sampling.
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

The Benefits of Implicit Regularization from SGD in Least Squares Problems.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Pure Exploration in Kernel and Neural Bandits.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Reward-Free Model-Based Reinforcement Learning with Linear Function Approximation.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Iterative Teacher-Aware Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Do Wider Neural Networks Really Help Adversarial Robustness?
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Provably Efficient Reinforcement Learning with Linear Function Approximation under Adaptivity Constraints.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Variance-Aware Off-Policy Evaluation with Linear Function Approximation.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Exploring Architectural Ingredients of Adversarially Robust Deep Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Nearly Minimax Optimal Reinforcement Learning for Discounted MDPs.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Uniform-PAC Bounds for Reinforcement Learning with Linear Function Approximation.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Proxy Convexity: A Unified Framework for the Analysis of Neural Networks Trained by Gradient Descent.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Risk Bounds for Over-parameterized Maximum Margin Classification on Sub-Gaussian Mixtures.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Variance-reduced First-order Meta-learning for Natural Language Processing Tasks.
Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2021

Towards Understanding the Spectral Bias of Deep Learning.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

On the Convergence of Hamiltonian Monte Carlo with Stochastic Gradients.
Proceedings of the 38th International Conference on Machine Learning, 2021

Provable Robustness of Adversarial Training for Learning Halfspaces with Noise.
Proceedings of the 38th International Conference on Machine Learning, 2021

Provably Efficient Reinforcement Learning for Discounted MDPs with Feature Mapping.
Proceedings of the 38th International Conference on Machine Learning, 2021

Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits.
Proceedings of the 38th International Conference on Machine Learning, 2021

MOTS: Minimax Optimal Thompson Sampling.
Proceedings of the 38th International Conference on Machine Learning, 2021

Logarithmic Regret for Reinforcement Learning with Linear Function Approximation.
Proceedings of the 38th International Conference on Machine Learning, 2021

Provable Generalization of SGD-trained Neural Networks of Any Width in the Presence of Adversarial Label Noise.
Proceedings of the 38th International Conference on Machine Learning, 2021

Agnostic Learning of Halfspaces with Gradient Descent via Soft Margins.
Proceedings of the 38th International Conference on Machine Learning, 2021

Neural Thompson Sampling.
Proceedings of the 9th International Conference on Learning Representations, 2021

Direction Matters: On the Implicit Bias of Stochastic Gradient Descent with Moderate Learning Rate.
Proceedings of the 9th International Conference on Learning Representations, 2021

How Much Over-parameterization Is Sufficient to Learn Deep ReLU Networks?
Proceedings of the 9th International Conference on Learning Representations, 2021

Nearly Minimax Optimal Reinforcement Learning for Linear Mixture Markov Decision Processes.
Proceedings of the Conference on Learning Theory, 2021

Double Explore-then-Commit: Asymptotic Optimality and Beyond.
Proceedings of the Conference on Learning Theory, 2021

2020
Gradient descent optimizes over-parameterized deep ReLU networks.
Mach. Learn., 2020

Stochastic Nested Variance Reduction for Nonconvex Optimization.
J. Mach. Learn. Res., 2020

Provable Multi-Objective Reinforcement Learning with Generative Models.
CoRR, 2020

Direction Matters: On the Implicit Regularization Effect of Stochastic Gradient Descent with Moderate Learning Rate.
CoRR, 2020

Does Network Width Really Help Adversarial Robustness?
CoRR, 2020

Minimax Optimal Reinforcement Learning for Discounted MDPs.
CoRR, 2020

Revisiting Membership Inference Under Realistic Assumptions.
CoRR, 2020

Exploring Private Federated Learning with Laplacian Smoothing.
CoRR, 2020

Mean-Field Analysis of Two-Layer Neural Networks: Non-Asymptotic Rates and Generalization Bounds.
CoRR, 2020

Is neuron coverage a meaningful measure for testing deep neural networks?
Proceedings of the ESEC/FSE '20: 28th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2020

A Finite-Time Analysis of Two Time-Scale Actor-Critic Methods.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Agnostic Learning of a Single Neuron with Gradient Descent.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

A Generalized Neural Tangent Kernel Analysis for Two-layer Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

DP-LSSGD: A Stochastic Optimization Method to Lift the Utility in Privacy-Preserving ERM.
Proceedings of Mathematical and Scientific Machine Learning, 2020

RayS: A Ray Searching Method for Hard-label Adversarial Attack.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Closing the Generalization Gap of Adaptive Gradient Methods in Training Deep Neural Networks.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Neural Contextual Bandits with UCB-based Exploration.
Proceedings of the 37th International Conference on Machine Learning, 2020

Optimization Theory for ReLU Neural Networks Trained with Normalization Layers.
Proceedings of the 37th International Conference on Machine Learning, 2020

A Finite-Time Analysis of Q-Learning with Neural Network Function Approximation.
Proceedings of the 37th International Conference on Machine Learning, 2020

On the Global Convergence of Training Deep Linear ResNets.
Proceedings of the 8th International Conference on Learning Representations, 2020

Improving Neural Language Generation with Spectrum Control.
Proceedings of the 8th International Conference on Learning Representations, 2020

Improving Adversarial Robustness Requires Revisiting Misclassified Examples.
Proceedings of the 8th International Conference on Learning Representations, 2020

Sample Efficient Policy Gradient Methods with Recursive Variance Reduction.
Proceedings of the 8th International Conference on Learning Representations, 2020

Stochastic Recursive Variance-Reduced Cubic Regularization Methods.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Accelerated Factored Gradient Descent for Low-Rank Matrix Factorization.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Understanding the Intrinsic Robustness of Image Distributions using Conditional Generative Models.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

A Knowledge Transfer Framework for Differentially Private Sparse Learning.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Rank Aggregation via Heterogeneous Thurstone Preference Models.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

A Frank-Wolfe Framework for Efficient and Effective Adversarial Attacks.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Generalization Error Bounds of Gradient Descent for Learning Over-Parameterized Deep ReLU Networks.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Stochastic Variance-Reduced Cubic Regularization Methods.
J. Mach. Learn. Res., 2019

Neural Contextual Bandits with Upper Confidence Bound-Based Exploration.
CoRR, 2019

Efficient Privacy-Preserving Nonconvex Optimization.
CoRR, 2019

DP-LSSGD: A Stochastic Optimization Method to Lift the Utility in Privacy-Preserving ERM.
CoRR, 2019

A Generalization Theory of Gradient Descent for Learning Over-parameterized Deep ReLU Networks.
CoRR, 2019

An Improved Convergence Analysis of Stochastic Variance-Reduced Policy Gradient.
Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019

Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

An Improved Analysis of Training Over-parameterized Deep Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Stochastic Gradient Hamiltonian Monte Carlo Methods with Recursive Variance Reduction.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Algorithm-Dependent Generalization Bounds for Overparameterized Deep Residual Networks.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Tight Sample Complexity of Learning One-hidden-layer Convolutional Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Differentially Private Iterative Gradient Hard Thresholding for Sparse Learning.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Lower Bounds for Smooth Nonconvex Finite-Sum Optimization.
Proceedings of the 36th International Conference on Machine Learning, 2019

On the Convergence and Robustness of Adversarial Training.
Proceedings of the 36th International Conference on Machine Learning, 2019

Sampling from Non-Log-Concave Distributions via Variance-Reduced Gradient Langevin Dynamics.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

Learning One-hidden-layer ReLU Networks via Gradient Descent.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Sample Efficient Stochastic Variance-Reduced Cubic Regularization Method.
CoRR, 2018

A Frank-Wolfe Framework for Efficient and Effective Adversarial Attacks.
CoRR, 2018

Stochastic Gradient Descent Optimizes Over-parameterized Deep ReLU Networks.
CoRR, 2018

On the Convergence of Adaptive Gradient Methods for Nonconvex Optimization.
CoRR, 2018

Finding Local Minima via Stochastic Nested Variance Reduction.
CoRR, 2018

Closing the Generalization Gap of Adaptive Gradient Methods in Training Deep Neural Networks.
CoRR, 2018

Subsampled Stochastic Variance-Reduced Gradient Langevin Dynamics.
Proceedings of the Thirty-Fourth Conference on Uncertainty in Artificial Intelligence, 2018

Continuous-Trait Probabilistic Model for Comparing Multi-species Functional Genomic Data.
Proceedings of the Research in Computational Molecular Biology, 2018

Differentially Private Hypothesis Transfer Learning.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2018

Stochastic Nested Variance Reduced Gradient Descent for Nonconvex Optimization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Third-order Smoothness Helps: Faster Stochastic Optimization Algorithms for Finding Local Minima.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Distributed Learning without Distress: Privacy-Preserving Empirical Risk Minimization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Stochastic Variance-Reduced Hamilton Monte Carlo Methods.
Proceedings of the 35th International Conference on Machine Learning, 2018

Stochastic Variance-Reduced Cubic Regularized Newton Method.
Proceedings of the 35th International Conference on Machine Learning, 2018

A Primal-Dual Analysis of Global Optimality in Nonconvex Low-Rank Matrix Recovery.
Proceedings of the 35th International Conference on Machine Learning, 2018

Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase Procrustes Flow.
Proceedings of the 35th International Conference on Machine Learning, 2018

Continuous and Discrete-time Accelerated Stochastic Mirror Descent for Strongly Convex Functions.
Proceedings of the 35th International Conference on Machine Learning, 2018

Covariate Adjusted Precision Matrix Estimation via Nonconvex Optimization.
Proceedings of the 35th International Conference on Machine Learning, 2018

Towards Personalized Learning in Mobile Sensing Systems.
Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018

A Unified Framework for Nonconvex Low-Rank plus Sparse Matrix Recovery.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

Accelerated Stochastic Mirror Descent: From Continuous-time Dynamics to Discrete-time Algorithms.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
Third-order Smoothness Helps: Even Faster Stochastic Optimization Algorithms for Finding Local Minima.
CoRR, 2017

Saving Gradient and Negative Curvature Computations: Finding Local Minima More Efficiently.
CoRR, 2017

Speeding Up Latent Variable Gaussian Graphical Model Estimation via Nonconvex Optimizations.
CoRR, 2017

Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimization.
CoRR, 2017

Robust Wirtinger Flow for Phase Retrieval with Arbitrary Corruption.
CoRR, 2017

Speeding Up Latent Variable Gaussian Graphical Model Estimation via Nonconvex Optimization.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Fast Newton Hard Thresholding Pursuit for Sparsity Constrained Nonconvex Optimization.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

High-Dimensional Variance-Reduced Stochastic Gradient Expectation-Maximization Algorithm.
Proceedings of the 34th International Conference on Machine Learning, 2017

A Unified Variance Reduction-Based Framework for Nonconvex Low-Rank Matrix Recovery.
Proceedings of the 34th International Conference on Machine Learning, 2017

Robust Gaussian Graphical Model Estimation with Arbitrary Corruption.
Proceedings of the 34th International Conference on Machine Learning, 2017

Uncertainty Assessment and False Discovery Rate Control in High-Dimensional Granger Causal Inference.
Proceedings of the 34th International Conference on Machine Learning, 2017

Efficient Algorithm for Sparse Tensor-variate Gaussian Graphical Models via Gradient Descent.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

A Unified Computational and Statistical Framework for Nonconvex Low-rank Matrix Estimation.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

Communication-efficient Distributed Sparse Linear Discriminant Analysis.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

High-dimensional Time Series Clustering via Cross-Predictability.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016
Forward Backward Greedy Algorithms for Multi-Task Learning with Faster Rates.
Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, 2016

Accelerated Stochastic Block Coordinate Gradient Descent for Sparsity Constrained Nonconvex Optimization.
Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, 2016

Contextual Bandits in a Collaborative Environment.
Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

Semiparametric Differential Graph Models.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Accelerated Stochastic Block Coordinate Descent with Optimal Sampling.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

On the Statistical Limits of Convex Relaxations.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Towards Faster Rates and Oracle Property for Low-Rank Matrix Estimation.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Precision Matrix Estimation in High Dimensional Gaussian Graphical Models with Faster Rates.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

Optimal Statistical and Computational Rates for One Bit Matrix Completion.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

Low-Rank and Sparse Structure Pursuit via Alternating Minimization.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2015
A Framework of Mining Trajectories from Untrustworthy Data in Cyber-Physical System.
ACM Trans. Knowl. Discov. Data, 2015

GIN: A Clustering Model for Capturing Dual Heterogeneity in Networked Data.
Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, Canada, April 30, 2015

Robust Classification of Information Networks by Consistent Graph Learning.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2015

High Dimensional EM Algorithm: Statistical Optimization and Asymptotic Normality.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Towards a Lower Sample Complexity for Robust One-bit Compressed Sensing.
Proceedings of the 32nd International Conference on Machine Learning, 2015

Classification with Active Learning and Meta-Paths in Heterogeneous Information Networks.
Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

2014
Online and active learning of big networks: theory and algorithms
PhD thesis, 2014

A network-assisted co-clustering algorithm to discover cancer subtypes based on gene expression.
BMC Bioinform., 2014

Personalized entity recommendation: a heterogeneous information network approach.
Proceedings of the Seventh ACM International Conference on Web Search and Data Mining, 2014

Batch-Mode Active Learning via Error Bound Minimization.
Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, 2014

Sparse PCA with Oracle Property.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Robust Tensor Decomposition with Gross Corruption.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

ClusCite: effective citation recommendation by information network-based clustering.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Online Spectral Learning on a Graph with Bandit Feedback.
Proceedings of the 2014 IEEE International Conference on Data Mining, 2014

Active Learning: A Survey.
Proceedings of the Data Classification: Algorithms and Applications, 2014

2013
Trustworthiness analysis of sensor data in cyber-physical systems.
J. Comput. Syst. Sci., 2013

Recommendation in heterogeneous information networks with implicit user feedback.
Proceedings of the Seventh ACM Conference on Recommender Systems, 2013

Mining lines in the sand: on trajectory discovery from untrustworthy data in cyber-physical system.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

Selective sampling on graphs for classification.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

Wireless sensor network data collection by connected cooperative UAVs.
Proceedings of the American Control Conference, 2013

Clustered Support Vector Machines.
Proceedings of the Sixteenth International Conference on Artificial Intelligence and Statistics, 2013

Unsupervised Link Selection in Networks.
Proceedings of the Sixteenth International Conference on Artificial Intelligence and Statistics, 2013

2012
Latent Community Topic Analysis: Integration of Community Discovery with Topic Modeling.
ACM Trans. Intell. Syst. Technol., 2012

Locality Preserving Feature Learning.
Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, 2012

Citation Prediction in Heterogeneous Bibliographic Networks.
Proceedings of the Twelfth SIAM International Conference on Data Mining, 2012

IntruMine: Mining Intruders in Untrustworthy Data of Cyber-physical Systems.
Proceedings of the Twelfth SIAM International Conference on Data Mining, 2012

Selective Labeling via Error Bound Minimization.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Towards Active Learning on Graphs: An Error Bound Minimization Approach.
Proceedings of the 12th IEEE International Conference on Data Mining, 2012

2011
Generalized Fisher Score for Feature Selection.
Proceedings of the UAI 2011, 2011

Linear Discriminant Dimensionality Reduction.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2011

Joint Feature Selection and Subspace Learning.
Proceedings of the IJCAI 2011, 2011

On Trivial Solution and Scale Transfer Problems in Graph Regularized NMF.
Proceedings of the IJCAI 2011, 2011

Correlated multi-label feature selection.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

Towards feature selection in network.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

Learning a Kernel for Multi-Task Clustering.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Collaborative Filtering: Weighted Nonnegative Matrix Factorization Incorporating User and Item Graphs.
Proceedings of the SIAM International Conference on Data Mining, 2010

HTF: a novel feature for general crack detection.
Proceedings of the International Conference on Image Processing, 2010

2009
Local Relevance Weighted Maximum Margin Criterion for Text Classification.
Proceedings of the SIAM International Conference on Data Mining, 2009

Transductive Classification via Dual Regularization.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2009

Co-clustering on manifolds.
Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28, 2009

Local Learning Regularized Nonnegative Matrix Factorization.
Proceedings of the IJCAI 2009, 2009

Two Dimensional Nonnegative Matrix Factorization.
Proceedings of the International Conference on Image Processing, 2009

Multiple Kernel Maximum Margin Criterion.
Proceedings of the International Conference on Image Processing, 2009

Learning the Shared Subspace for Multi-task Clustering and Transductive Transfer Classification.
Proceedings of the ICDM 2009, 2009

Two dimensional Maximum Margin Criterion.
Proceedings of the IEEE International Conference on Acoustics, 2009

Regular simplex criterion: A novel feature extraction criterion.
Proceedings of the IEEE International Conference on Acoustics, 2009

Subspace maximum margin clustering.
Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009

Multiframe Motion Segmentation via Penalized MAP Estimation and Linear Programming.
Proceedings of the British Machine Vision Conference, 2009

Neighborhood Preserving Nonnegative Matrix Factorization.
Proceedings of the British Machine Vision Conference, 2009

2008
A similarity measure under Log-Euclidean metric for stereo matching.
Proceedings of the 19th International Conference on Pattern Recognition (ICPR 2008), 2008

Belief propagation on Riemannian manifold for stereo matching.
Proceedings of the International Conference on Image Processing, 2008

A novel similarity measure under Riemannian metric for stereo matching.
Proceedings of the IEEE International Conference on Acoustics, 2008


  Loading...