Daniel Hsu

Orcid: 0000-0002-3495-7113

Affiliations:
  • Columbia University, Department of Computer Science, NY, USA
  • Rutgers University, Rutgers University, NY, USA (former)
  • University of California, San Diego, CA, USA (PhD 2010)


According to our database1, Daniel Hsu authored at least 131 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Interactive Machine Teaching by Labeling Rules and Instances.
CoRR, 2024

One-layer transformers fail to solve the induction heads task.
CoRR, 2024

Group-wise oracle-efficient algorithms for online multi-group learning.
CoRR, 2024

Seasonality Patterns in 311-Reported Foodborne Illness Cases and Machine Learning-Identified Indications of Foodborne Illnesses from Yelp Reviews, New York City, 2022-2023.
CoRR, 2024

Polynomial time auditing of statistical subgroup fairness for Gaussian data.
CoRR, 2024

Transformers Provably Learn Sparse Token Selection While Fully-Connected Nets Cannot.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Transformers, parallel computation, and logarithmic depth.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Multi-group Learning for Hierarchical Groups.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Distribution-Specific Auditing for Subgroup Fairness.
Proceedings of the 5th Symposium on Foundations of Responsible Computing, 2024

On the sample complexity of parameter estimation in logistic regression with normal design.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023
Efficient Estimation of the Central Mean Subspace via Smoothed Gradient Outer Products.
CoRR, 2023

On the sample complexity of estimation in logistic regression.
CoRR, 2023

Representational Strengths and Limitations of Transformers.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Intrinsic dimensionality and generalization properties of the R-norm inductive bias.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Unbiased estimators for random design regression.
J. Mach. Learn. Res., 2022

Statistical-Computational Trade-offs in Tensor PCA and Related Problems via Communication Complexity.
CoRR, 2022

Masked prediction tasks: a parameter identifiability view.
CoRR, 2022

Masked Prediction: A Parameter Identifiability View.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Simple and near-optimal algorithms for hidden stratification and multi-group learning.
Proceedings of the International Conference on Machine Learning, 2022

Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Learning Tensor Representations for Meta-Learning.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Consistent Risk Estimation in Moderately High-Dimensional Linear Regression.
IEEE Trans. Inf. Theory, 2021

Contrastive Estimation Reveals Topic Posterior Information to Linear Models.
J. Mach. Learn. Res., 2021

Classification vs regression in overparameterized regimes: Does the loss function matter?
J. Mach. Learn. Res., 2021

Statistical Query Lower Bounds for Tensor PCA.
J. Mach. Learn. Res., 2021

Bayesian decision-making under misspecified priors with applications to meta-learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Support vector machines and linear regression coincide with very high-dimensional features.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Generalization bounds via distillation.
Proceedings of the 9th International Conference on Learning Representations, 2021

On the Approximation Power of Two-Layer Networks of Random ReLUs.
Proceedings of the Conference on Learning Theory, 2021

Contrastive learning, multi-view redundancy, and linear models.
Proceedings of the Algorithmic Learning Theory, 2021

On the proliferation of support vectors in high dimensions.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Quantifying the Effects of COVID-19 on Restaurant Reviews.
Proceedings of the Ninth International Workshop on Natural Language Processing for Social Media, 2021

2020
Parameter identification in Markov chain choice models.
Theor. Comput. Sci., 2020

Two Models of Double Descent for Weak Features.
SIAM J. Math. Data Sci., 2020

Biased Programmers? Or Biased Data? A Field Experiment in Operationalizing AI Ethics.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Ensuring Fairness Beyond the Training Data.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Cross-Lingual Text Classification with Minimal Resources by Transferring a Sparse Teacher.
Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2020, 2020

Diameter-based Interactive Structure Discovery.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Detecting Foodborne Illness Complaints in Multiple Languages Using English Annotations Only.
Proceedings of the 11th International Workshop on Health Text Mining and Information Analysis, 2020

2019
Privacy Accounting and Quality Control in the Sage Differentially Private ML Platform.
ACM SIGOPS Oper. Syst. Rev., 2019

Kernel Approximation Methods for Speech Recognition.
J. Mach. Learn. Res., 2019

A cryptographic approach to black box adversarial machine learning.
CoRR, 2019

Diameter-based Interactive Structure Search.
CoRR, 2019

How many variables should be entered in a principal component regression equation?
CoRR, 2019

Certified Robustness to Adversarial Examples with Differential Privacy.
Proceedings of the 2019 IEEE Symposium on Security and Privacy, 2019

On the number of variables to use in principal component regression.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Teaching a black-box learner.
Proceedings of the 36th International Conference on Machine Learning, 2019

A Gradual, Semi-Discrete Approach to Generative Network Training via Explicit Wasserstein Minimization.
Proceedings of the 36th International Conference on Machine Learning, 2019

Leveraging Just a Few Keywords for Fine-Grained Aspect Detection Through Weakly Supervised Co-Training.
Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing, 2019

Attribute-efficient learning of monomials over highly-correlated variables.
Proceedings of the Algorithmic Learning Theory, 2019

Correcting the bias in least squares regression with volume-rescaled sampling.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

Weakly Supervised Attention Networks for Fine-Grained Opinion Mining and Public Health.
Proceedings of the 5th Workshop on Noisy User-generated Text, 2019

2018
Discovering foodborne illness in online restaurant reviews.
J. Am. Medical Informatics Assoc., 2018

Reconciling modern machine learning and the bias-variance trade-off.
CoRR, 2018

Tail bounds for volume sampled linear regression.
CoRR, 2018

On the Connection between Differential Privacy and Adversarial Robustness in Machine Learning.
CoRR, 2018

Non-Gaussian information from weak lensing data via deep learning.
CoRR, 2018

Benefits of over-parameterization with EM.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Leveraged volume sampling for linear regression.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Overfitting or perfect fitting? Risk bounds for classification and regression rules that interpolate.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Learning Single-Index Models in Gaussian Space.
Proceedings of the Conference On Learning Theory, 2018

2017
Greedy Approaches to Symmetric Orthogonal Tensor Decomposition.
SIAM J. Matrix Anal. Appl., 2017

Mixing time estimation in reversible Markov chains from a single sample path.
CoRR, 2017

Coding with asymmetric prior knowledge.
CoRR, 2017

Linear regression without correspondence.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

FairTest: Discovering Unwarranted Associations in Data-Driven Applications.
Proceedings of the 2017 IEEE European Symposium on Security and Privacy, 2017

Correspondence retrieval.
Proceedings of the 30th Conference on Learning Theory, 2017

2016
Unsupervised Part-Of-Speech Tagging with Anchor Hidden Markov Models.
Trans. Assoc. Comput. Linguistics, 2016

Loss Minimization and Parameter Estimation with Heavy Tails.
J. Mach. Learn. Res., 2016

AI's 10 to Watch.
IEEE Intell. Syst., 2016

Greedy bi-criteria approximations for k-medians and k-means.
CoRR, 2016

Global Analysis of Expectation Maximization for Mixtures of Two Gaussians.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Search Improves Label for Active Learning.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Compact kernel models for acoustic modeling via random feature selection.
Proceedings of the 2016 IEEE International Conference on Acoustics, 2016

2015
Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors.
SIAM J. Matrix Anal. Appl., 2015

Learning sparse low-threshold linear classifiers.
J. Mach. Learn. Res., 2015

When are overcomplete topic models identifiable? uniqueness of tensor tucker decompositions with structured sparsity.
J. Mach. Learn. Res., 2015

Discovering Unwarranted Associations in Data-Driven Applications with the FairTest Testing Toolkit.
CoRR, 2015

A Spectral Algorithm for Latent Dirichlet Allocation.
Algorithmica, 2015

Method of moments learning for left-to-right Hidden Markov models.
Proceedings of the 2015 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics, 2015

Efficient and Parsimonious Agnostic Active Learning.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Mixing Time Estimation in Reversible Markov Chains from a Single Sample Path.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Sunlight: Fine-grained Targeting Detection at Scale with Statistical Confidence.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

Tensor Decompositions for Learning Latent Variable Models (A Survey for ALT).
Proceedings of the Algorithmic Learning Theory - 26th International Conference, 2015

Model-based Word Embeddings from Decompositions of Count Matrices.
Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing of the Asian Federation of Natural Language Processing, 2015

2014
Tensor decompositions for learning latent variable models.
J. Mach. Learn. Res., 2014

A tensor approach to learning mixed membership community models.
J. Mach. Learn. Res., 2014

Random Design Analysis of Ridge Regression.
Found. Comput. Math., 2014

Weighted sampling of outer products.
CoRR, 2014

Scalable Nonlinear Learning with Adaptive Polynomial Expansions.
CoRR, 2014

A Spectral Algorithm for Learning Class-Based n-gram Models of Natural Language.
Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, 2014

The Large Margin Mechanism for Differentially Private Maximization.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Scalable Non-linear Learning with Adaptive Polynomial Expansions.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Heavy-tailed regression with a generalized median-of-means.
Proceedings of the 31th International Conference on Machine Learning, 2014

Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits.
Proceedings of the 31th International Conference on Machine Learning, 2014

2013
Stochastic Convex Optimization with Bandit Feedback.
SIAM J. Optim., 2013

Approximate loss minimization with heavy tails.
CoRR, 2013

Contrastive Learning Using Spectral Methods.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Learning mixtures of spherical gaussians: moment methods and spectral decompositions.
Proceedings of the Innovations in Theoretical Computer Science, 2013

Learning Linear Bayesian Networks with Latent Variables.
Proceedings of the 30th International Conference on Machine Learning, 2013

A Tensor Spectral Approach to Learning Mixed Membership Community Models.
Proceedings of the COLT 2013, 2013

2012
A Method of Moments for Mixture Models and Hidden Markov Models.
Proceedings of the COLT 2012, 2012

A spectral algorithm for learning Hidden Markov Models.
J. Comput. Syst. Sci., 2012

Analysis of a randomized approximation scheme for matrix multiplication
CoRR, 2012

Learning Gaussian Mixture Models: Moment Methods and Spectral Decompositions
CoRR, 2012

Two SVDs Suffice: Spectral decompositions for probabilistic topic modeling and latent Dirichlet allocation
CoRR, 2012

Learning High-Dimensional Mixtures of Graphical Models
CoRR, 2012

Identifiability and Unmixing of Latent Parse Trees.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Learning Mixtures of Tree Graphical Models.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Convergence Rates for Differentially Private Statistical Estimation.
Proceedings of the 29th International Conference on Machine Learning, 2012

2011
Robust Matrix Decomposition With Sparse Corruptions.
IEEE Trans. Inf. Theory, 2011

Sample Complexity Bounds for Differentially Private Learning.
Proceedings of the COLT 2011, 2011

A tail inequality for quadratic forms of subgaussian random vectors
CoRR, 2011

An Analysis of Random Design Linear Regression
CoRR, 2011

Parallel Online Learning
CoRR, 2011

Dimension-free tail inequalities for sums of random matrices.
CoRR, 2011

Efficient Optimal Learning for Contextual Bandits.
Proceedings of the UAI 2011, 2011

Spectral Methods for Learning Multivariate Latent Tree Structure.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

2010
Algorithms for active learning.
PhD thesis, 2010

Robust Matrix Decomposition with Outliers
CoRR, 2010

An Online Learning-based Framework for Tracking.
Proceedings of the UAI 2010, 2010

Agnostic Active Learning Without Constraints.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

2009
Tracking using explanation-based modeling
CoRR, 2009

Multi-Label Prediction via Compressed Sensing.
Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

A Parameter-free Hedging Algorithm.
Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

2008
A new Hedging algorithm and its application to inferring latent random variables
CoRR, 2008

Hierarchical sampling for active learning.
Proceedings of the Machine Learning, 2008

2007
A general agnostic active learning algorithm.
Proceedings of the Advances in Neural Information Processing Systems 20, 2007

On-Line Estimation with the Multivariate Gaussian Distribution.
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

2006
A Concentration Theorem for Projections.
Proceedings of the UAI '06, 2006

2004
a CAPpella: programming by demonstration of context-aware applications.
Proceedings of the 2004 Conference on Human Factors in Computing Systems, 2004


  Loading...