Xi Chen

Orcid: 0000-0002-9049-9452

Affiliations:
  • New York University, Stern School of Business, NY, USA
  • University of California at Berkeley, CA, USA (former)
  • Carnegie Mellon University, School of Computer Science, Pittsburgh, PA, USA (PhD 2013)


According to our database1, Xi Chen authored at least 45 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Robust Dynamic Pricing with Demand Learning in the Presence of Outlier Customers.
Oper. Res., July, 2023

Active Learning for Contextual Search with Binary Feedback.
Manag. Sci., April, 2023

Differential Privacy in Personalized Pricing with Nonparametric Demand Models.
Oper. Res., March, 2023

Utility Fairness in Contextual Dynamic Pricing with Demand Learning.
CoRR, 2023

Combinatorial Inference on the Optimal Assortment in the Multinomial Logit Model.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

MEV Makes Everyone Happy under Greedy Sequencing Rule.
Proceedings of the 2023 Workshop on Decentralized Finance and Security, 2023

2022
Asymptotically Optimal Sequential Design for Rank Aggregation.
Math. Oper. Res., 2022

Privacy-Preserving Dynamic Personalized Pricing with Demand Learning.
Manag. Sci., 2022

A Statistical Learning Approach to Personalization in Revenue Management.
Manag. Sci., 2022

Accelerating Adaptive Cubic Regularization of Newton's Method via Random Sampling.
J. Mach. Learn. Res., 2022

Fairness-aware Network Revenue Management with Demand Learning.
CoRR, 2022

2021
Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models.
Math. Oper. Res., 2021

The Discrete Moment Problem with Nonconvex Shape Constraints.
Oper. Res., 2021

2020
Dynamic Assortment Optimization with Changing Contextual Information.
J. Mach. Learn. Res., 2020

Uncertainty Quantification for Demand Prediction in Contextual Dynamic Pricing.
CoRR, 2020

DoubleEnsemble: A New Ensemble Method Based on Sample Reweighting and Feature Selection for Financial Data Analysis.
Proceedings of the 20th IEEE International Conference on Data Mining, 2020

2019
Technical Note - Nonstationary Stochastic Optimization Under <i>L</i><sub><i>p, q</i></sub>-Variation Measures.
Oper. Res., 2019

Optimal Design of Process Flexibility for General Production Systems.
Oper. Res., 2019

Robust Dynamic Assortment Optimization in the Presence of Outlier Customers.
CoRR, 2019

Large-Scale Markov Decision Problems via the Linear Programming Dual.
CoRR, 2019

2018
Optimal Instance Adaptive Algorithm for the Top-K Ranking Problem.
IEEE Trans. Inf. Theory, 2018

A note on a tight lower bound for capacitated MNL-bandit assortment selection models.
Oper. Res. Lett., 2018

Dynamic Assortment Selection under the Nested Logit Models.
CoRR, 2018

A Nearly Instance Optimal Algorithm for Top-<i>k</i> Ranking under the Multinomial Logit Model.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
A Note on Tight Lower Bound for MNL-Bandit Assortment Selection Models.
CoRR, 2017

Non-stationary Stochastic Optimization with Local Spatial and Temporal Changes.
CoRR, 2017

A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model.
CoRR, 2017

Competitive analysis of the top-<i>K</i> ranking problem.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Adaptive Multiple-Arm Identification.
Proceedings of the 34th International Conference on Machine Learning, 2017

2016
Competitive analysis of the top-K ranking problem.
CoRR, 2016

2015
Optimal Sparse Designs for Process Flexibility via Probabilistic Expanders.
Oper. Res., 2015

2014
Optimal PAC Multiple Arm Identification with Applications to Crowdsourcing.
Proceedings of the 31th International Conference on Machine Learning, 2014

2013
Learning with Sparcity: Structures, Optimization and Applications.
PhD thesis, 2013

2012
Structured Sparse Canonical Correlation Analysis.
Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, 2012

Adaptive Multi-task Sparse Learning with an Application to fMRI Study.
Proceedings of the Twelfth SIAM International Conference on Data Mining, 2012

2011
Smoothing Proximal Gradient Method for General Structured Sparse Learning.
Proceedings of the UAI 2011, 2011

Sparse Latent Semantic Analysis.
Proceedings of the Eleventh SIAM International Conference on Data Mining, 2011

Direct Robust Matrix Factorizatoin for Anomaly Detection.
Proceedings of the 11th IEEE International Conference on Data Mining, 2011

2010
An Efficient Proximal-Gradient Method for Single and Multi-task Regression with Structured Sparsity
CoRR, 2010

Graph-Structured Multi-task Regression and an Efficient Optimization Method for General Fused Lasso
CoRR, 2010

Temporal Collaborative Filtering with Bayesian Probabilistic Tensor Factorization.
Proceedings of the SIAM International Conference on Data Mining, 2010

Learning Preferences with Millions of Parameters by Enforcing Sparsity.
Proceedings of the ICDM 2010, 2010

Learning Spatial-Temporal Varying Graphs with Applications to Climate Data Analysis.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Accelerated Gradient Method for Multi-task Sparse Learning Problem.
Proceedings of the ICDM 2009, 2009


  Loading...