Pan Xu

According to our database1, Pan Xu
  • authored at least 43 papers between 2011 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

Stochastic Nested Variance Reduction for Nonconvex Optimization.
CoRR, 2018

A PTAS for a Class of Stochastic Dynamic Programs.
CoRR, 2018

Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts.
CoRR, 2018

Stochastic Variance-Reduced Cubic Regularized Newton Method.
CoRR, 2018

Stochastic Variance-Reduced Hamilton Monte Carlo Methods.
CoRR, 2018

Onion Curve: A Space Filling Curve with Near-Optimal Clustering.
CoRR, 2018

Algorithms to Approximate Column-Sparse Packing Problems.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

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

A PTAS for a Class of Stochastic Dynamic Programs.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

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

Allocation Problems in Ride-Sharing Platforms: Online Matching With Offline Reusable Resources.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Enumeration of Maximal Cliques from an Uncertain Graph.
IEEE Trans. Knowl. Data Eng., 2017

The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem.
SIAM Journal on Optimization, 2017

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

Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources.
CoRR, 2017

Algorithms to Approximate Column-Sparse Packing Problems.
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

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

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

Budgeted Online Assignment in Crowdsourcing Markets: Theory and Practice.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 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

2016
New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching.
CoRR, 2016

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

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

New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Mining maximal cliques from an uncertain graph.
Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

Improved Bounds in Stochastic Matching and Optimization.
Proceedings of the Approximation, 2015

2014
Optimality of Clustering Properties of Space-Filling Curves.
ACM Trans. Database Syst., 2014

An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions.
Computers & OR, 2014

2013
Investigation on Dynamic Calibration for an Optical-Fiber Solids Concentration Probe in Gas-Solid Two-Phase Flows.
Sensors, 2013

Mining Maximal Cliques from an Uncertain Graph.
CoRR, 2013

A New Polyphase Generalized Sequence of Length pq and Its Linear Complexity.
Proceedings of the 2013 5th International Conference on Intelligent Networking and Collaborative Systems, 2013

2012
On the optimality of clustering properties of space filling curves.
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

A Lower Bound on Proximity Preservation by Space Filling Curves.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

Sequence analysis of the OmpA/MotB gene from Riemerella anatipestifer by bioinformatics.
Proceedings of the 5th International Conference on BioMedical Engineering and Informatics, 2012

2011
An optimization approach to gene stacking.
European Journal of Operational Research, 2011


  Loading...