default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJason M. Klusowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Matias D. Cattaneo, Jason M. Klusowski, Boris Shigida:
On the Implicit Bias of Adam. ICML 2024- [i21]Xin Chen, Jason M. Klusowski:
Stochastic Gradient Descent for Additive Nonparametric Regression. CoRR abs/2401.00691 (2024) - [i20]Annie Liang, Thomas Jemielita, Andy Liaw, Vladimir Svetnik, Lingkang Huang, Richard Baumgartner, Jason M. Klusowski:
Challenges in Variable Importance Ranking Under Correlation. CoRR abs/2402.03447 (2024) - 2023
- [i19]Jason M. Klusowski, Jonathan W. Siegel:
Sharp Convergence Rates for Matching Pursuit. CoRR abs/2307.07679 (2023) - [i18]Matias D. Cattaneo, Jason M. Klusowski, Boris Shigida:
On the Implicit Bias of Adam. CoRR abs/2309.00079 (2023) - [i17]Xin Chen, Jason M. Klusowski, Yan Shuo Tan:
Error Reduction from Stacked Regressions. CoRR abs/2309.09880 (2023) - [i16]Jianqing Fan, Cheng Gao, Jason M. Klusowski:
Robust Transfer Learning with Unreliable Source Data. CoRR abs/2310.04606 (2023) - 2022
- [i15]Matias D. Cattaneo, Jason M. Klusowski, Peter M. Tian:
On the Pointwise Behavior of Recursive Partitioning and Its Implications for Heterogeneous Causal Effect Estimation. CoRR abs/2211.10805 (2022) - 2021
- [j4]Zhiqi Bu, Jason M. Klusowski
, Cynthia Rush, Weijie J. Su:
Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing. IEEE Trans. Inf. Theory 67(1): 506-537 (2021) - [c7]Jason M. Klusowski, Peter M. Tian:
Nonparametric Variable Screening with Optimal Decision Stumps. AISTATS 2021: 748-756 - [c6]Jason M. Klusowski:
Sharp Analysis of a Simple Model for Random Forests. AISTATS 2021: 757-765 - [c5]Ryan Theisen, Jason M. Klusowski, Michael W. Mahoney:
Good Classifiers are Abundant in the Interpolating Regime. AISTATS 2021: 3376-3384 - [i14]Jason M. Klusowski:
Universal Consistency of Decision Trees for High Dimensional Additive Models. CoRR abs/2104.13881 (2021) - [i13]Zhiqi Bu, Jason M. Klusowski, Cynthia Rush, Weijie J. Su:
Characterizing the SLOPE Trade-off: A Variational Perspective and the Donoho-Tanner Limit. CoRR abs/2105.13302 (2021) - 2020
- [c4]Jason M. Klusowski:
Sparse Learning with CART. NeurIPS 2020 - [i12]Jason M. Klusowski:
Sparse learning with CART. CoRR abs/2006.04266 (2020) - [i11]Ryan Theisen, Jason M. Klusowski, Michael W. Mahoney:
Good linear classifiers are abundant in the interpolating regime. CoRR abs/2006.12625 (2020) - [i10]Jason M. Klusowski, Peter M. Tian:
Nonparametric Variable Screening with Optimal Decision Stumps. CoRR abs/2011.02683 (2020)
2010 – 2019
- 2019
- [j3]Jason M. Klusowski, Dana Yang, W. D. Brinda:
Estimating the Coefficients of a Mixture of Two Linear Regressions by Expectation Maximization. IEEE Trans. Inf. Theory 65(6): 3515-3524 (2019) - [c3]Zhiqi Bu, Jason M. Klusowski, Cynthia Rush, Weijie J. Su:
Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing. NeurIPS 2019: 9361-9371 - [i9]Andrew R. Barron, Jason M. Klusowski:
Complexity, Statistical Risk, and Metric Entropy of Deep Nets Using Total Path Variation. CoRR abs/1902.00800 (2019) - [i8]Jason M. Klusowski:
Best Split Nodes for Regression Trees. CoRR abs/1906.10086 (2019) - [i7]Zhiqi Bu, Jason M. Klusowski, Cynthia Rush, Weijie J. Su:
Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing. CoRR abs/1907.07502 (2019) - [i6]Ryan Theisen, Jason M. Klusowski, Huan Wang, Nitish Shirish Keskar, Caiming Xiong, Richard Socher:
Global Capacity Measures for Deep ReLU Networks via Path Sampling. CoRR abs/1910.10245 (2019) - 2018
- [j2]W. D. Brinda, Jason M. Klusowski:
Finite-Sample Risk Bounds for Maximum Likelihood Estimation With Arbitrary Penalties. IEEE Trans. Inf. Theory 64(4): 2727-2741 (2018) - [j1]Jason M. Klusowski, Andrew R. Barron:
Approximation by Combinations of ReLU and Squared ReLU Ridge Functions With ℓ1 and ℓ0 Controls. IEEE Trans. Inf. Theory 64(12): 7649-7656 (2018) - [c2]Jason M. Klusowski, Yihong Wu:
Counting Motifs with Graph Sampling. COLT 2018: 1966-2011 - [i5]Jason M. Klusowski, Yihong Wu:
Estimating the Number of Connected Components in a Graph via Subgraph Sampling. CoRR abs/1801.04339 (2018) - [i4]Jason M. Klusowski, Yihong Wu:
Counting Motifs with Graph Sampling. CoRR abs/1802.07773 (2018) - [i3]Jason M. Klusowski:
Complete Analysis of a Random Forest Model. CoRR abs/1805.02587 (2018) - [i2]Andrew R. Barron, Jason M. Klusowski:
Approximation and Estimation for High-Dimensional Deep Learning Networks. CoRR abs/1809.03090 (2018) - 2017
- [c1]Jason M. Klusowski, Andrew R. Barron:
Minimax lower bounds for ridge combinations including neural nets. ISIT 2017: 1376-1380 - [i1]Jason M. Klusowski, Andrew R. Barron:
Minimax Lower Bounds for Ridge Combinations Including Neural Nets. CoRR abs/1702.02828 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 00:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
