The Tien Mai

According to our database, The Tien Mai authored at least 11 papers between 2017 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

A reduced-rank approach to predicting multiple binary responses through machine learning.

The Tien Mai

Stat. Comput., December, 2023

An efficient adaptive MCMC algorithm for Pseudo-Bayesian quantum tomography.

The Tien Mai

Comput. Stat., June, 2023

From Bilinear Regression to Inductive Matrix Completion: A Quasi-Bayesian Analysis.

The Tien Mai

Entropy, February, 2023

Misclassification excess risk bounds for 1-bit matrix completion.

The Tien Mai

CoRR, 2023

2022

On Regret Bounds for Continual Single-Index Learning.

The Tien Mai

Proceedings of the Intelligent Computing, 2022

2021

Bayesian matrix completion with a spectral scaled Student prior: theoretical guarantee and efficient sampling.

The Tien Mai

CoRR, 2021

Numerical comparisons between Bayesian and frequentist low-rank matrix completion: estimation accuracy and uncertainty quantification.

The Tien Mai

CoRR, 2021

On continual single index learning.

The Tien Mai

CoRR, 2021

Boosting heritability: estimating the genetic component of phenotypic variation with multiple sample splitting.

The Tien Mai, Paul Turner, Jukka Corander

BMC Bioinform., 2021

2019

Learning Cancer Drug Sensitivities in Large-Scale Screens from Multi-omics Data with Local Low-Rank Structure.

The Tien Mai, Leiv Rønneberg, Zhi Zhao, Manuela Zucknick, Jukka Corander

Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2019

2017

Regret Bounds for Lifelong Learning.

Pierre Alquier, The Tien Mai, Massimiliano Pontil

Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017