Jonathan W. Siegel

Orcid: 0000-0002-1493-4889

According to our database1, Jonathan W. Siegel authored at least 35 papers between 2018 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Embedding Dimension Lower Bounds for Universality of Deep Sets and Janossy Pooling.
CoRR, May, 2026

Quantitative Approximation Rates for Group Equivariant Learning.
CoRR, February, 2026

Approximation Rates for Shallow ReLU\(^k\) Neural Networks on Sobolev Spaces via the Radon Transform.
SIAM J. Math. Anal., 2026

2025
In-Context Multi-Operator Learning with DeepOSets.
CoRR, December, 2025

Nearly optimal bounds on the Fourier sampling numbers of Besov spaces.
CoRR, August, 2025

Sharp Convergence Rates for Matching Pursuit.
IEEE Trans. Inf. Theory, July, 2025

Optimal Recovery Meets Minimax Estimation.
CoRR, February, 2025

On the expressiveness and spectral bias of KANs.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

2024
Sharp Bounds on the Approximation Rates, Metric Entropy, and n-Widths of Shallow Neural Networks.
Found. Comput. Math., April, 2024

Sharp lower bounds on the manifold widths of Sobolev and Besov spaces.
J. Complex., 2024

Approximation Rates for Shallow ReLU<sup>k</sup> Neural Networks on Sobolev Spaces via the Radon Transform.
CoRR, 2024

Convergence and error control of consistent PINNs for elliptic PDEs.
CoRR, 2024

Nesterov acceleration despite very noisy gradients.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Equivariant Frames and the Impossibility of Continuous Canonicalization.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023
Greedy training algorithms for neural networks and applications to PDEs.
J. Comput. Phys., July, 2023

Optimal Approximation Rates for Deep ReLU Neural Networks on Sobolev and Besov Spaces.
J. Mach. Learn. Res., 2023

A qualitative difference between gradient flows of convex functions in finite- and infinite-dimensional Hilbert spaces.
CoRR, 2023

Weighted variation spaces and approximation by shallow ReLU networks.
CoRR, 2023

Optimal Approximation of Zonoids and Uniform Approximation by Shallow Neural Networks.
CoRR, 2023

Entropy-based convergence rates of greedy algorithms.
CoRR, 2023

Achieving acceleration despite very noisy gradients.
CoRR, 2023

Sharp Lower Bounds on Interpolation by Deep ReLU Neural Networks at Irregularly Spaced Data.
CoRR, 2023

2022
Optimal Convergence Rates for the Orthogonal Greedy Algorithm.
IEEE Trans. Inf. Theory, 2022

Optimal Approximation Rates for Deep ReLU Neural Networks on Sobolev Spaces.
CoRR, 2022

On the Activation Function Dependence of the Spectral Bias of Neural Networks.
CoRR, 2022

2021
An efficient greedy training algorithm for neural networks and applications in PDEs.
CoRR, 2021

Characterization of the Variation Spaces Corresponding to Shallow Neural Networks.
CoRR, 2021

Improved Convergence Rates for the Orthogonal Greedy Algorithm.
CoRR, 2021

Optimal Approximation Rates and Metric Entropy of ReLU$^k$ and Cosine Networks.
CoRR, 2021

2020
Approximation rates for neural networks with general activation functions.
Neural Networks, 2020

Accuracy, Efficiency and Optimization of Signal Fragmentation.
Multiscale Model. Simul., 2020

High-Order Approximation Rates for Neural Networks with ReLU<sup>k</sup> Activation Functions.
CoRR, 2020

Training Sparse Neural Networks using Compressed Sensing.
CoRR, 2020

2019
On the Approximation Properties of Neural Networks.
CoRR, 2019

2018
Accelerated First-Order Optimization with Orthogonality Constraints
PhD thesis, 2018


  Loading...