activity
20082025
most citedReconciling modern machine learning practice and the bias-variance trade-off

1.6k citations · 4.2k across the 71 of their papers we have counts for

collaborators
Showing 2017Show all

7 papers · 1 filter

math.ST2017

Mixing time estimation in reversible Markov chains from a single sample path

Daniel Hsu, Aryeh Kontorovich, David A. Levin +2

The spectral gap of a finite, ergodic, and reversible Markov chain is an important parameter measuring the asymptotic rate of convergence. In applications, the transition matri…

math.ST2017

Parameter identification in Markov chain choice models

Arushi Gupta, Daniel Hsu

This work studies the parameter identification problem for the Markov chain choice model of Blanchet, Gallego, and Goyal used in assortment planning. In this model, the product sel…

cs.DS2017★ 1 cited

Coding sets with asymmetric information

Alexandr Andoni, Javad Ghaderi, Daniel Hsu +2

We study the following one-way asymmetric transmission problem, also a variant of model-based compressed sensing: a resource-limited encoder has to report a small set from a un…

math.NA2017

Greedy Approaches to Symmetric Orthogonal Tensor Decomposition

Cun Mu, Daniel Hsu, Donald Goldfarb

Finding the symmetric and orthogonal decomposition (SOD) of a tensor is a recurring problem in signal processing, machine learning and statistics. In this paper, we review, establi…

math.NA2017★ 19 cited

Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors

Cun Mu, Daniel Hsu, Donald Goldfarb

Many idealized problems in signal processing, machine learning and statistics can be reduced to the problem of finding the symmetric canonical decomposition of an underlying symmet…

cs.LG2017★ 50 cited

Linear regression without correspondence

Daniel Hsu, Kevin Shi, Xiaorui Sun

This article considers algorithmic and statistical aspects of linear regression when the correspondence between the covariates and the responses is unknown. First, a fully polynomi…