default search action
William Swartworth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]William J. Swartworth, David P. Woodruff:
Fast Sampling-Based Sketches for Tensors. ICML 2024 - [c11]Mehrdad Ghadiri
, Yin Tat Lee
Improving the Bit Complexity of Communication for Distributed Convex Optimization. STOC 2024: 1130-1140 - [i9]Mehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan, William Swartworth, David P. Woodruff, Guanghao Ye:
Improving the Bit Complexity of Communication for Distributed Convex Optimization. CoRR abs/2403.19146 (2024) - [i8]William Swartworth, David P. Woodruff:
Fast Sampling Based Sketches for Tensors. CoRR abs/2406.06735 (2024) - 2023
- [j2]Yotam Yaniv
Selectable Set Randomized Kaczmarz. Numer. Linear Algebra Appl. 30(1) (2023) - [c10]Shuang Li, William J. Swartworth, Martin Takác, Deanna Needell, Robert M. Gower:
SP2 : A Second Order Stochastic Polyak Method. ICLR 2023 - [c9]Erin George, Michael Murray, William Swartworth, Deanna Needell:
Training shallow ReLU networks on noisy data using hinge loss: when do we overfit and is it benign? NeurIPS 2023 - [c8]William Swartworth, Deanna Needell, Rachel A. Ward, Mark Kong, Halyun Jeong:
Nearly Optimal Bounds for Cyclic Forgetting. NeurIPS 2023 - [c7]William Swartworth, David P. Woodruff:
Optimal Eigenvalue Approximation via Sketching. STOC 2023: 145-155 - [i7]William Swartworth, David P. Woodruff:
Optimal Eigenvalue Approximation via Sketching. CoRR abs/2304.09281 (2023) - [i6]Erin George, Michael Murray, William Swartworth, Deanna Needell:
Training shallow ReLU networks on noisy data using hinge loss: when do we overfit and is it benign? CoRR abs/2306.09955 (2023) - [i5]Cullen Haselby, Mark A. Iwen, Deanna Needell, Elizaveta Rebrova, William Swartworth:
Fast and Low-Memory Compressive Sensing Algorithms for Low Tucker-Rank Tensor Approximation from Streamed Measurements. CoRR abs/2308.13709 (2023) - 2022
- [j1]Jamie Haddock
Quantile-Based Iterative Methods for Corrupted Systems of Linear Equations. SIAM J. Matrix Anal. Appl. 43(2): 605-637 (2022) - [c6]Xiaofu Ding, Xinyu Dong, Olivia McGough, Chenxin Shen, Annie Ulichney, Ruiyao Xu, William Swartworth, Jocelyn T. Chi, Deanna Needell:
Population-Based Hierarchical Non-Negative Matrix Factorization for Survey Data. BDCAT 2022: 184-193 - [c5]Deanna Needell, William Swartworth, David P. Woodruff:
Testing Positive Semidefiniteness Using Linear Measurements. FOCS 2022: 87-97 - [i4]Deanna Needell, William Swartworth, David P. Woodruff:
Testing Positive Semidefiniteness Using Linear Measurements. CoRR abs/2204.03782 (2022) - [i3]Shuang Li, William J. Swartworth, Martin Takác, Deanna Needell, Robert M. Gower:
SP2: A Second Order Stochastic Polyak Method. CoRR abs/2207.08171 (2022) - 2021
- [c4]Shuang Li, Deanna Needell, William Swartworth:
An Untrained One-layer Convolutional Network-based Method for Line Spectral Estimation. ACSCC 2021: 795-799 - [c3]Michael R. Lindstrom, William J. Swartworth, Deanna Needell:
Reconstructing Piezoelectric Responses over a Lattice: Adaptive Sampling of Low Dimensional Time Series Representations Based on Relative Isolation and Gradient Size. SMC 2021: 420-429 - [i2]Yotam Yaniv, Jacob D. Moorman, William Swartworth, Thomas K. Tu, Daji Landis, Deanna Needell:
Selectable Set Randomized Kaczmarz. CoRR abs/2110.04703 (2021) - 2020
- [c2]Jamie Haddock, Deanna Needell, Elizaveta Rebrova
Stochastic Gradient Descent Variants for Corrupted Systems of Linear Equations. CISS 2020: 1-6 - [i1]Jamie Haddock, Deanna Needell, Elizaveta Rebrova, William Swartworth:
Quantile-based Iterative Methods for Corrupted Systems of Linear Equations. CoRR abs/2009.08089 (2020)
2010 – 2019
- 2017
- [c1]Cody R. Freitag, Eric Price, William J. Swartworth:
Testing Hereditary Properties of Sequences. APPROX-RANDOM 2017: 44:1-44:10
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-05 23:43 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: