Rachel A. Ward

Orcid: 0000-0001-7651-089X

According to our database1, Rachel A. Ward authored at least 84 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Generating synthetic data for neural operators.
CoRR, 2024

2023
Learning to Forecast Dynamical Systems from Streaming Data.
SIAM J. Appl. Dyn. Syst., June, 2023

Cluster-aware Semi-supervised Learning: Relational Knowledge Distillation Provably Learns Clustering.
CoRR, 2023

Robust Implicit Regularization via Weight Normalization.
CoRR, 2023

Convergence of Alternating Gradient Descent for Matrix Factorization.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Nearly Optimal Bounds for Cyclic Forgetting.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Adaptively Weighted Data Augmentation Consistency Regularization for Robust Optimization under Concept Shift.
Proceedings of the International Conference on Machine Learning, 2023

Sample Efficiency of Data Augmentation Consistency Regularization.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Johnson-Lindenstrauss Embeddings with Kronecker Structure.
SIAM J. Matrix Anal. Appl., December, 2022

Overparameterization and Generalization Error: Weighted Trigonometric Interpolation.
SIAM J. Math. Data Sci., June, 2022

Compressed sensing with a jackknife and a bootstrap.
J. Data Sci. Stat. Vis., 2022

Matrix Concentration for Products.
Found. Comput. Math., 2022

AdaWAC: Adaptively Weighted Augmentation Consistency Regularization for Volumetric Medical Image Segmentation.
CoRR, 2022

On the fast convergence of minibatch heavy ball momentum.
CoRR, 2022

An Exponentially Increasing Step-size for Parameter Estimation in Statistical Models.
CoRR, 2022

Scalable symmetric Tucker tensor decomposition.
CoRR, 2022

Side-effects of Learning from Low Dimensional Data Embedded in an Euclidean Space.
CoRR, 2022

SHRIMP: Sparser Random Feature Models via Iterative Magnitude Pruning.
Proceedings of the Mathematical and Scientific Machine Learning, 2022

Concentration of Random Feature Matrices in High-Dimensions.
Proceedings of the Mathematical and Scientific Machine Learning, 2022

Arbitrary-Length Analogs to de Bruijn Sequences.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

The Power of Adaptivity in SGD: Self-Tuning Step Sizes with Unbounded Gradients and Affine Variance.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

How catastrophic can catastrophic forgetting be in linear regression?
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

AdaLoss: A Computationally-Efficient and Provably Convergent Adaptive Gradient Method.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
SHRIMP: Sparser Random Feature Models via Iterative Magnitude Pruning.
CoRR, 2021

Learning to Forecast Dynamical Systems from Streaming Data.
CoRR, 2021

Function Approximation via Sparse Random Features.
CoRR, 2021

Bootstrapping the Error of Oja's Algorithm.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Streaming k-PCA: Efficient guarantees for Oja's algorithm, beyond rank-one updates.
Proceedings of the Conference on Learning Theory, 2021

2020
Extracting Structured Dynamical Systems Using Sparse Optimization With Very Few Samples.
Multiscale Model. Simul., 2020

Recovery guarantees for polynomial coefficients from weakly dependent data with outliers.
J. Approx. Theory, 2020

Weighted Optimization: better generalization by smoother interpolation.
CoRR, 2020

Implicit Regularization and Convergence for Weight Normalization.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Linear Convergence of Adaptive Stochastic Gradient Descent.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Implicit Regularization of Normalization Methods.
CoRR, 2019

Faster Johnson-Lindenstrauss Transforms via Kronecker Products.
CoRR, 2019

Bias of Homotopic Gradient Descent for the Hinge Loss.
CoRR, 2019

AdaOja: Adaptive Learning Rates for Streaming PCA.
CoRR, 2019

Global Convergence of Adaptive Gradient Methods for An Over-parameterized Neural Network.
CoRR, 2019

AdaGrad stepsizes: sharp convergence over nonconvex landscapes.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Extracting Sparse High-Dimensional Dynamics from Limited Data.
SIAM J. Appl. Math., 2018

Recovery guarantees for polynomial approximation from dependent data with outliers.
CoRR, 2018

AdaGrad stepsizes: Sharp convergence over nonconvex landscapes, from any initialization.
CoRR, 2018

Greedy Variance Estimation for the LASSO.
CoRR, 2018

WNGrad: Learn the Learning Rate in Gradient Descent.
CoRR, 2018

2017
Exact Recovery of Chaotic Systems from Highly Corrupted Data.
Multiscale Model. Simul., 2017

Fast Cross-Polytope Locality-Sensitive Hashing.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Learning the second-moment matrix of a smooth function from point samples.
Proceedings of the 51st Asilomar Conference on Signals, Systems, and Computers, 2017

2016
The Sample Complexity of Weighted Sparse Approximation.
IEEE Trans. Signal Process., 2016

One-Bit Compressive Sensing With Norm Estimation.
IEEE Trans. Inf. Theory, 2016

Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm.
Math. Program., 2016

A polynomial-time relaxation of the Gromov-Hausdorff distance.
CoRR, 2016

Batched Stochastic Gradient Descent with Weighted Sampling.
CoRR, 2016

Clustering subgaussian mixtures by semidefinite programming.
CoRR, 2016

Improved bounds for sparse recovery from subsampled random convolutions.
CoRR, 2016

MC^2: A Two-Phase Algorithm for Leveraged Matrix Completion.
CoRR, 2016

Learning the Differential Correlation Matrix of a Smooth Function From Point Samples.
CoRR, 2016

Clustering subgaussian mixtures with k-means.
Proceedings of the 2016 IEEE Information Theory Workshop, 2016

2015
Compressive Sensing with Redundant Dictionaries and Structured Measurements.
SIAM J. Math. Anal., 2015

Completing any low-rank matrix, provably.
J. Mach. Learn. Res., 2015

Recovery guarantees for exemplar-based clustering.
Inf. Comput., 2015

Relax, No Need to Round: Integrality of Clustering Formulations.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2014
Stable and Robust Sampling Strategies for Compressive Imaging.
IEEE Trans. Image Process., 2014

A unified framework for linear dimensionality reduction in l<sub>1</sub>.
CoRR, 2014

Coherent Matrix Completion.
Proceedings of the 31th International Conference on Machine Learning, 2014

2013
Near-Optimal Compressed Sensing Guarantees for Total Variation Minimization.
IEEE Trans. Image Process., 2013

Stable Image Reconstruction Using Total Variation Minimization.
SIAM J. Imaging Sci., 2013

A Symbol-Based Algorithm for Decoding Bar Codes.
SIAM J. Imaging Sci., 2013

Stochastic gradient descent and the randomized Kaczmarz algorithm.
CoRR, 2013

2012
Root-Exponential Accuracy for Coarse Quantization of Finite Frame Expansions.
IEEE Trans. Inf. Theory, 2012

Weighted Eigenfunction Estimates with Applications to Compressed Sensing.
SIAM J. Math. Anal., 2012

Sparse Legendre expansions via l<sub>1</sub>-minimization.
J. Approx. Theory, 2012

Total variation minimization for stable multidimensional signal recovery
CoRR, 2012

Compressive imaging: stable and robust recovery from variable density frequency samples
CoRR, 2012

2011
New and Improved Johnson-Lindenstrauss Embeddings via the Restricted Isometry Property.
SIAM J. Math. Anal., 2011

Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization.
SIAM J. Optim., 2011

Computing the confidence levels for a root-mean-square test of goodness-of-fit.
Appl. Math. Comput., 2011

Trust in Human-Computer Interactions as Measured by Frustration, Surprise, and Workload.
Proceedings of the Foundations of Augmented Cognition. Directing the Future of Adaptive Systems, 2011

This is your brain on interfaces: enhancing usability testing with functional near-infrared spectroscopy.
Proceedings of the International Conference on Human Factors in Computing Systems, 2011

2010
On the Complexity of Mumford-Shah-Type Regularization, Viewed as a Relaxed Sparsity Constraint.
IEEE Trans. Image Process., 2010

Iterative Thresholding Meets Free-Discontinuity Problems.
Found. Comput. Math., 2010

Lower bounds for the error decay incurred by coarse quantization schemes
CoRR, 2010

Efficient and stable recovery of Legendre-sparse polynomials.
Proceedings of the 44th Annual Conference on Information Sciences and Systems, 2010

2009
Compressed sensing with cross validation.
IEEE Trans. Inf. Theory, 2009

Shape deformation in continuous map generalization.
GeoInformatica, 2009


  Loading...