Shadow Tomography of Quantum StatesResearch Paper
Shadow Tomography of Quantum States establishes the selected mathematical guarantees below. The mission turns those original paper results into precise Lean proof targets.
886 missions · 536 completed
The science of systems that learn from data and experience. Its scope runs from the statistical and mathematical foundations of learning, including generalization, expressivity, and computational limits, through the design of learning algorithms, deep learning, reinforcement learning, and probabilistic methods, to the empirical study of large models and the trustworthiness, interpretability, and societal impact of learned systems.
Shadow Tomography of Quantum States establishes the selected mathematical guarantees below. The mission turns those original paper results into precise Lean proof targets.
The Power of Two Bases: Robust and copy-optimal certification of nearly all quantum states with few-qubit measurements establishes the selected mathematical guarantees below. The mission turns those original paper results into precise Lean proof targets.
Quantum state tomography via compressed sensing establishes the selected mathematical guarantees below. The mission turns those original paper results into precise Lean proof targets.
Quantum chi-squared tomography and mutual information testing establishes the selected mathematical guarantees below. The mission turns those original paper results into precise Lean proof targets.
Improved quantum data analysis establishes the selected mathematical guarantees below. The mission turns those original paper results into precise Lean proof targets.
Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators establishes the selected mathematical guarantees below. The mission turns those original paper results into precise Lean proof targets.
Direct Fidelity Estimation from Few Pauli Measurements establishes the selected mathematical guarantees below. The mission turns those original paper results into precise Lean proof targets.
Quantum versus Classical Learnability (Servedio, Gortler) establishes the selected mathematical guarantees below. The mission turns those original paper results into precise Lean proof targets.
The Optimal Sample Complexity of PAC Learning (Hanneke) establishes the selected mathematical guarantees below. The mission turns those original paper results into precise Lean proof targets.
Many operational decisions are linear programs whose cost vector is uncertain but partly predictable: shortest-path routing with uncertain travel times, portfolio choice with uncertain returns, shipment planning with uncertain costs. Before deciding, one observes features (traffic, market signals) correlated with the costs . Contextual linear optimization…
Kernel ridge regression is a standard nonparametric estimator with optimal statistical guarantees, but it needs the kernel matrix of the data: roughly time and memory. Random features (Rahimi and Recht, NeurIPS 2007) replace the kernel by an average over randomly sampled feature functions, turning the problem into ridge regression…
The projected stochastic subgradient method minimizes an expected loss over a closed convex set : it samples a data point, steps against a sampled subgradient, and projects back onto . For convex its sample complexity has been known for decades, and for smooth nonconvex the stochastic gradient method needs …
Many problems in statistical learning and signal processing take the form of minimizing an expectation plus a regularizer or constraint , where the only access to is through samples . The classical tool is the stochastic (proximal) subgradient method, which replaces at the current point by a random linear…
Many problems in statistics, signal processing and machine learning minimize an expected loss that is neither smooth nor convex: robust phase retrieval, blind deconvolution, covariance estimation with the loss, training of networks with ReLU activations, and composite problems with convex and smooth . A common structural feature of these…
Principal component analysis (PCA) asks for the -dimensional affine subspace that best fits a cloud of points in in the least-squares sense. When is very large, or the points arrive as a stream or are spread over many machines, one wants to replace the data by a small summary on which the cost of every candidate subspace can still be…
An online decision maker often sees information about a customer, patient, or request before choosing an action. A bandit with covariates models this setting when the reward of every available action is initially unknown and only the reward of the chosen action is observed. A method must learn which action works best for which covariates while paying for…
Bayesian inference, statistical physics and machine learning all ask for samples from a probability distribution on whose density is known only up to a constant, . The unadjusted Langevin algorithm (ULA) is the Euler–Maruyama discretisation of the Langevin diffusion, whose invariant law is . It needs only…
A finite-sum optimization problem asks for one vector that performs well across many component objectives. In empirical risk minimization, each component can represent the loss from one data point. A full gradient uses every component, whereas a stochastic gradient uses one component and can be much cheaper per step. The latter carries sampling noise, so a…
Adam (Kingma and Ba, 2015, arXiv:1412.6980) is one of the most widely used optimizers for training neural networks. It is a stochastic gradient method that keeps exponential moving averages of the stochastic gradients and of their coordinatewise squares, rescales both by bias-correction factors, and divides the first by the square root of the second. Its…
Adam (Kingma and Ba, 2015, arXiv:1412.6980) is the default optimizer for training deep neural networks. At each step it keeps exponential moving averages and of the stochastic gradients and of their coordinatewise squares, corrects both for their initialization at zero (the bias-correction or debiasing step , …
In ordinary statistical learning, a hypothesis is chosen from training data drawn from a distribution and judged by its risk under that same . In practice the test distribution often differs from the training one: covariate shift, domain drift, adversarial perturbation of inputs. Distributionally robust learning replaces the risk at by the worst risk…
In statistical learning a hypothesis is chosen from a class using samples drawn from an unknown distribution , and its quality is measured by the risk . When the distribution at deployment time may differ from the one that generated the data (domain drift, adversarial perturbation, model misspecification), a natural…
Regularized least squares (RLS) in a reproducing kernel Hilbert space is a basic estimator of nonparametric regression and of kernel-based learning. Its learning rate is the speed at which the expected excess risk goes to zero as the sample size grows. A rate is useful only if it is known to be optimal, and optimality is a lower-bound statement about…
Regularized least squares (RLS), also called kernel ridge regression, is one of the standard estimators of statistical learning: given a sample of input–output pairs, it fits a function from a reproducing kernel Hilbert space by minimizing the empirical squared error plus a multiple of the squared norm. Caponnetto and De Vito (FoCM 2007) proved that, over a…
Regularized least squares (RLS, also called kernel ridge regression or Tikhonov regularization) is the simplest learning algorithm built on a reproducing kernel Hilbert space. Given examples drawn independently from an unknown distribution , it returns the function in a hypothesis space that minimizes the empirical squared…