28 citations · 127 across the 46 of their papers we have counts for
8 papers · 1 filter
Computationally and Statistically Efficient Truncated Regression
Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos +1
We provide a computationally and statistically efficient estimator for the classical problem of truncated linear regression, where the dependent variable and its co…
Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions
Alessandro Epasto, Mohammad Mahdian, Vahab Mirrokni +1
A soft-max function has two main efficiency measures: (1) approximation - which corresponds to how well it approximates the maximum function, (2) smoothness - which shows how sensi…
The Complexity of Constrained Min-Max Optimization
Constantinos Daskalakis, Stratis Skoulakis, Manolis Zampetakis
Despite its important applications in Machine Learning, min-max optimization of nonconvex-nonconcave objectives remains elusive. Not only are there no known first-order methods con…
Truncated Linear Regression in High Dimensions
Constantinos Daskalakis, Dhruv Rohatgi, Manolis Zampetakis
As in standard linear regression, in truncated linear regression, we are given access to observations whose dependent variable equals $y_i= A_i^{\rm T} \cdot x^* + η…
Estimation and Inference with Trees and Forests in High Dimensions
Vasilis Syrgkanis, Manolis Zampetakis
We analyze the finite sample mean squared error (MSE) performance of regression trees and forests in the high dimensional regime with binary features, under a sparsity constraint.…
Constant-Expansion Suffices for Compressed Sensing with Generative Priors
Constantinos Daskalakis, Dhruv Rohatgi, Manolis Zampetakis
Generative neural networks have been empirically found very promising in providing effective structural priors for compressed sensing, since they can be trained to span low-dimensi…
A Topological Characterization of Modulo- Arguments and Implications for Necklace Splitting
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki +1
The classes PPA- have attracted attention lately, because they are the main candidates for capturing the complexity of Necklace Splitting with thieves, for prime . Howeve…
Consensus-Halving: Does It Ever Get Easier?
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki +1
In the -Consensus-Halving problem, a fundamental problem in fair division, there are agents with valuations over the interval , and the goal is to divide th…