Ben Adcock, Simon Fraser University

Research

Read how they describe their research on their Simon Fraser University profile.

Latest papers

The devil in the (de)tails: an improved recovery guarantee for sparse approximation
arXiv (Cornell University) · 2026 · first author
Fourier extensions for matrix-function block encodings with error-independent subnormalization bounds
arXiv (Cornell University) · 2026 · senior author
Near-Optimal Learning of Gaussian Sobolev Operators
arXiv (Cornell University) · 2026 · first author

All 218 publications

From the 150 most recent of 218 publications.

01

The devil in the (de)tails: an improved recovery guarantee for sparse approximation

Ben Adcock, Simone Brugiapaglia, A. Gupta

arXiv (Cornell University)2026First authorOpen Access

DOI: 10.48550/arxiv.2606.26459

02

Fourier extensions for matrix-function block encodings with error-independent subnormalization bounds

Peter Brearley, Thomas Howarth, Ben Adcock

arXiv (Cornell University)2026Senior authorOpen Access

03

Near-Optimal Learning of Gaussian Sobolev Operators

Ben Adcock, Michael Griebel, Gregor Maier

arXiv (Cornell University)2026First authorOpen Access

04

Fourier extensions for matrix-function block encodings with error-independent subnormalization bounds

Peter Brearley, Thomas Howarth, Ben Adcock

arXiv (Cornell University)2026Senior authorOpen Access

DOI: 10.48550/arxiv.2601.18024

05

GRIFDIR: Graph Resolution-Invariant FEM Diffusion Models in Function Spaces over Irregular Domains

James Rowbottom, Elizabeth L. Baker, Nick Huang, Ben Adcock, Carola-Bibiane Schönlieb, Alexander H. Denker

arXiv (Cornell University)2026Open Access

DOI: 10.48550/arxiv.2605.03497

06

Christoffel Adaptive Sampling for Sparse Random Feature Expansions

Ben Adcock, Khiem Can, Xuemeng Wang

arXiv (Cornell University)2026First authorOpen Access

07

Universal, sample-optimal algorithms for recovery of anisotropic functions from i.i.d. samples

Ben Adcock, Avi Gupta

arXiv (Cornell University)2026First authorOpen Access

DOI: 10.48550/arxiv.2604.07660

08

GRIFDIR: Graph Resolution-Invariant FEM Diffusion Models in Function Spaces over Irregular Domains

James Rowbottom, Elizabeth L. Baker, Nick Huang, Ben Adcock, Carola-Bibiane Schönlieb, Alexander H. Denker

arXiv (Cornell University)2026Open Access

09

Christoffel Adaptive Sampling for Sparse Random Feature Expansions

Ben Adcock, Khiem Can, Xuemeng Wang

arXiv (Cornell University)2026First authorOpen Access

DOI: 10.48550/arxiv.2603.18251

10

Christoffel-DPS: Optimal sensor placement in diffusion posterior sampling for arbitrary distributions

James Rowbottom, Nick Huang, Carola-Bibiane Schönlieb, Ben Adcock

arXiv (Cornell University)2026Senior authorOpen Access

Frequent collaborators

Department of Mathematics
Department of Mathematics and Statistics

Co-authors at Simon Fraser University, colored by department. Thicker lines mean more shared papers; select anyone to open their profile and their own map.

Benjamin Adcock

Department of Mathematics

217 shared papers, latest 2026

Simone Brugiapaglia

Department of Mathematics and Statistics

28 shared papers, latest 2026

Leonid Chindelevitch

School of Computing Science

1 shared papers, latest 2021

Write to this professor

A short, specific email works best. This draft uses one of their recent papers; replace the parts in brackets with your own details before sending.

Applying for

Paper to mention

Subject: Prospective PhD student Dear Professor Adcock, My name is [your name], and I am a [your current degree or role] at [your institution]. I am applying for a PhD position starting in [term and year]. I read your paper "The devil in the (de)tails: an improved recovery guarantee for sparse approximation" (2026), and it connects closely to my own work on [your research topic]. [One or two sentences on what you did and what you learned.] Are you accepting new PhD students for [term and year]? I have attached my CV and transcripts, and I would be glad to talk at a time that suits you. Thank you for your time. Kind regards, [your name]