Publications

"My soul’s imprint lies in the art I create."  - S., 2023

 

   - Articles distinguished by "with ..." have alphabetical author lists or co-first authors, as is the convention in math stats, stats learning theory and theoretical computer science. 

   - Authors are listed as last name first + first initial last.

Overviews



Selected Recent Papers

For the complete list, please see Google Scholar.





- 2024 ASA SLDS student paper award


- Bagging achieves a stabler performance in weak signal-to-noise ratio regimes while being consistent in large sample regimes. I refer to this ability as "algorithmic adaptivity". This notion of adaptivity holds the promise to explain "why do some algorithms always outperform other seemingly optimal algorithms?"



- Python code "automean"

- The objective function proposed in this paper was referred to as the Sun-Huber objective by later works; see Holland (2023).

- Reviews: Open reviews, and a private one by Lee and Valiant.


 - Python code "DDM"


        - Python package "SRLR"


 - This paper is the first to come up with robust bandit and RL algorithms with tight variance-aware (instance-dependent) regrets.


- Matlab code "QMF"


        - Python package "ACLS "

        - R package "ACLS"


 - This paper is motivated by the paper below. Our earlier idea on the full rank case appeared in Lin 2019; see the acknowledgement therein. 



  • Little A, Xie Y, and Sun Q (2023).  An analysis of classical multidimensional scaling with applications to clustering, Information and Inference, 12, 72-112.

- Patel et al. (2023) pointed out that "Little et al. (2022), the first strong theoretical guarantee for CMDS in the literature, studies the performance of CMDS on the task of clustering under sub-Gaussian mixture models. "

  - This is the first sharp Bernstein's inequality for general Markov chains. 

  - Here is a long story about this paper: Originally submitted to Electronic Journal of Probability (EJP) on August 7, 2020, this paper has been subjected to three separate rounds of peer review over the ensuing three years. The decisions at each stage were as follows: an initial reject and resubmit, a subsequent major revision, and, most recently a final reject


  • Yu M, Sun Q, and Zhou WX. Low-rank matrix recovery under heavy-tailed errors, Bernoulli, in press. 


  • Zhai Z, Chen H, and Sun Q. Bounded projection matrix approximation with applications to community detection, [arXiv], IEEE Signal Processing Letters, in press. 

- R Code


  - This is the first sharp Hoeffding's inequality for general Markov chains. 


         - A short commentary article by Eran Raviv about our paper: https://eranraviv.com/adaptive-huber-regression/.

  - R package "I-LAMM"

- You can also find implementations in the following two packages  - R package "tfHuber",  Python package "tfHuber".





        - R package "Rcvxclustr"


 - R package "tfHuber"

 - Python package "tfHuber"


        - R package "orthoDr"


        - R package "FarmTest"


         - R package "I-LAMM"