Fetching the paper…
Reading the bibliography…
Consider a setting where there are $N$ heterogeneous units and $p$ interventions.
1910
Earlier work this paper cites.
Wedin, P.-Å. [1972], ‘Perturbation bounds in connection with singular value decomposition’, BIT Numerical Mathematics
1972
Earlier work this paper cites.
Karpovsky, M. [1976], Finite Orthogonal Series in Design of Digital Devices
1976
Earlier work this paper cites.
Brandman, Y., Orlitsky, A. and Hennessy, J. [1990], ‘A spectral lower bound technique for the size of decision trees and two-level and/or circuits’, IEEE Transactions on Computers
1990
Earlier work this paper cites.
Angrist, J. D., Imbens, G. W. and Rubin, D. B. [1996], ‘Identification of causal effects using instrumental variables’, Journal of the American statistical Association
1996
Earlier work this paper cites.
Vonesh, E. and Chinchilli, V. M. [1996], Linear and nonlinear models for the analysis of repeated measurements
1996
Earlier work this paper cites.
Troyanskaya, O., Cantor, M., Sherlock, G., Brown, P., Hastie, T., Tibshirani, R., Botstein, D. and Altman, R. B. [2001], ‘Missing value estimation methods for dna microarrays’, Bioinformatics
2001
Earlier work this paper cites.
Jones, B. and Kenward, M. G. [2003], Design and analysis of cross-over trials
2003
Earlier work this paper cites.
Mossel, E., O’Donnell, R. and Servedio, R. P. [2003], Learning juntas, in
2003
Earlier work this paper cites.
Bertrand, M. and Mullainathan, S. [2004], ‘Are emily and greg more employable than lakisha and jamal? a field experiment on labor market discrimination’, American economic review
2004
Earlier work this paper cites.
George, E., Hunter, W. G. and Hunter, J. S. [2005], Statistics for experimenters: design, innovation, and discovery
2005
Earlier work this paper cites.
Agarwal, A., Shah, D. and Shen, D. [2020 b
2006
Earlier work this paper cites.
Zhao, P. and Yu, B. [2006], ‘On model selection consistency of lasso’, The Journal of Machine Learning Research
2006
Earlier work this paper cites.
Zou, H. [2006], ‘The adaptive lasso and its oracle properties’, Journal of the American statistical association
2006
Earlier work this paper cites.
Duflo, E., Glennerster, R. and Kremer, M. [2007], ‘Using randomization in development economics research: A toolkit’, Handbook of development economics
2007
Earlier work this paper cites.
O’Donnell, R. [2008], Some topics in analysis of boolean functions, in
2008
Earlier work this paper cites.
Keshavan, R., Montanari, A. and Oh, S. [2009], ‘Matrix completion from noisy entries’, Advances in neural information processing systems
2009
Earlier work this paper cites.
Abadie, A., Diamond, A. and Hainmueller, J. [2010], ‘Synthetic control methods for comparative case studies: Estimating the effect of california’s tobacco control program’, Journal of the American statistical Association
2010
Earlier work this paper cites.
Agarwal, A., Shah, D. and Shen, D. [2020 a
2010
Earlier work this paper cites.
Candes, E. J. and Plan, Y. [2010], ‘Matrix completion with noise’, Proceedings of the IEEE
2010
Earlier work this paper cites.
Keshavan, R. H., Montanari, A. and Oh, S. [2010], ‘Matrix completion from a few entries’, IEEE transactions on information theory
2010
Earlier work this paper cites.
Mazumder, R., Hastie, T. and Tibshirani, R. [2010], ‘Spectral regularization algorithms for learning large incomplete matrices’, The Journal of Machine Learning Research
2010
Cited alongside, same era.
Recht, B. [2011], ‘A simpler approach to matrix completion.’, Journal of Machine Learning Research
2011
Cited alongside, same era.
Wu, C. J. and Hamada, M. S. [2011], Experiments: planning, analysis, and optimization
2011
Cited alongside, same era.
Candes, E. and Recht, B. [2012], ‘Exact matrix completion via convex optimization’, Communications of the ACM
2012
Cited alongside, same era.
Tropp, J. A. [2012], ‘User-friendly tail bounds for sums of random matrices’, Foundations of computational mathematics
2012
Cited alongside, same era.
Sharma, M., Harper, F. M. and Karypis, G. [2019], ‘Learning from sets of items in recommender systems’, ACM Trans. Interact. Intell. Syst
2019
Later among the works it cites.
Wainwright, M. J. [2019], High-dimensional statistics: A non-asymptotic viewpoint
2019
Later among the works it cites.
Klusowski, J. [2020], ‘Sparse learning with cart’, Advances in Neural Information Processing Systems
2020
Later among the works it cites.
Syrgkanis, V. and Zampetakis, M. [2020], Estimation and inference with trees and forests in high dimensions, in
2020
Later among the works it cites.
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Vershynin, R. [2012], Introduction to the non-asymptotic analysis of random matrices, in
2012
Cited alongside, same era.
Liu, H. and Yu, B. [2013], ‘Asymptotic properties of lasso+ mls and lasso+ ridge in sparse high-dimensional linear regression’
2013
Cited alongside, same era.
Eriksson, S. and Rooth, D.-O. [2014], ‘Do employers use unemployment as a sorting criterion when hiring? evidence from a field experiment’, American economic review
2014
Cited alongside, same era.
Gavish, M. and Donoho, D. L. [2014], ‘The optimal hard threshold for singular values is 4 / 3 4/\sqrt{3} ’, IEEE Transactions on Information Theory
2014
Cited alongside, same era.
Hainmueller, J., Hopkins, D. J. and Yamamoto, T. [2014], ‘Causal inference in conjoint analysis: Understanding multidimensional choices via stated preference experiments’, Political Analysis
2014
Cited alongside, same era.
Chatterjee, S. [2015], ‘Matrix estimation by universal singular value thresholding’
2015
Cited alongside, same era.
Dasgupta, T., Pillai, N. S. and Rubin, D. B. [2015], ‘Causal inference from 2 k factorial designs by using potential outcomes’, Journal of the Royal Statistical Society: Series B: Statistical Methodology
2015
Cited alongside, same era.
Anish Agarwal, Devavrat Shah, D. S. and Song, D. [2021], ‘On robustness of principal component regression’, Journal of the American Statistical Association
2021
Later among the works it cites.
Athey, S., Bayati, M., Doudchenko, N., Imbens, G. and Khosravi, K. [2021], ‘Matrix completion methods for causal panel data models’, Journal of the American Statistical Association
2021
Later among the works it cites.
Bai, J. and Ng, S. [2021], ‘Matrix completion, counterfactuals, and factor analysis of missing data’, Journal of the American Statistical Association
2021
Later among the works it cites.
de la Cuesta, B., Egami, N. and Imai, K. [2021], ‘Improving the external validity of conjoint analysis: The essential role of profile distribution’, Political Analysis
2021
Later among the works it cites.
2021
Later among the works it cites.
Agarwal, A., Tan, Y. S., Ronen, O., Singh, C. and Yu, B. [2022], ‘Hierarchical shrinkage: improving the accuracy and interpretability of tree-based methods’
2022
Later among the works it cites.
Mazumder, R., Meng, X. and Wang, H. [2022], Quant-bnb: A scalable branch-and-bound method for optimal decision trees with continuous features, in
2022
Later among the works it cites.
Zhao, A. and Ding, P. [2022], ‘Regression-based causal inference with factorial experiments: estimands, model specifications and design-based properties’, Biometrika
2022
Later among the works it cites.
Agarwal, A., Dahleh, M., Shah, D. and Shen, D. [2023], Causal matrix completion, in
2023
Closest in time.
Agarwal, A., Kenney, A. M., Tan, Y. S., Tang, T. M. and Yu, B. [2023], ‘Mdi+: A flexible random forest-based feature importance framework’
2023
Closest in time.
Bravo-Hermsdorff, G., Watson, D. S., Yu, J., Zeitler, J. and Silva, R. [2023], ‘Intervention generalization: A view from factor graph models’
2023
Closest in time.
Goplerud, M., Imai, K. and Pashley, N. E. [2023], ‘Estimating heterogeneous causal effects of high-dimensional treatments: Application to conjoint analysis’
2023
Closest in time.
Tan, Y. S., Singh, C., Nasseri, K., Agarwal, A., Duncan, J., Ronen, O., Epland, M., Kornblith, A. and Yu, B. [2023], ‘Fast interpretable greedy-tree sums’
2023
Closest in time.
Ding, P. [2024], ‘Linear model and extensions’
2024
Closest in time.
Negahban, S. and Shah, D. [2012], Learning sparse boolean polynomials, in
2036
Closest in time.
Candès, E. J. and Tao, T. [2010], ‘The power of convex relaxation: Near-optimal matrix completion’, IEEE Transactions on Information Theory
2080
Closest in time.