Related papers: Susceptibility Formulation of Density Matrix Pertu…
A susceptibility propagation that is constructed by combining a belief propagation and a linear response method is used for approximate computation for Markov random fields. Herein, we formulate a new, improved susceptibility propagation by…
We present a general formalism that allows for the computation of large-order renormalized expansions in the spacetime representation, effectively doubling the numerically attainable perturbation order of renormalized Feynman diagrams. We…
Adaptive perturbation is a new method for perturbatively computing the eigenvalues and eigenstates of quantum mechanical Hamiltonians that heretofore were not believed to be obtainable by such methods. The novel feature of adaptive…
We present a probabilistic model with discrete latent variables that control the computation time in deep learning models such as ResNets and LSTMs. A prior on the latent variables expresses the preference for faster computation. The amount…
The idea of adaptive perturbation theory is to divide a Hamiltonian into a solvable part and a perturbation part. The solvable part contains the non-interacting sector and the diagonal elements of Fock space from the interacting terms. The…
We formulate an optimization problem to estimate probability densities in the context of multidimensional problems that are sampled with uneven probability. It considers detector sensitivity as an heterogeneous density and takes advantage…
Density functional perturbation theory is a well-established method to study responses of molecules and solids, especially responses to atomic displacements or to different perturbing fields (electric, magnetic). Like for density functional…
An implicit purification scheme is proposed for calculation of the temperature-dependent, grand canonical single-particle density matrix, given as a Fermi operator expansion in terms of the Hamiltonian. The computational complexity is shown…
Density estimation is a fundamental task in statistics and machine learning applications. Kernel density estimation is a powerful tool for non-parametric density estimation in low dimensions; however, its performance is poor in higher…
This paper describes a recursive estimation procedure for multivariate binary densities (probability distributions of vectors of Bernoulli random variables) using orthogonal expansions. For $d$ covariates, there are $2^d$ basis coefficients…
The fidelity susceptibility serves as a universal probe for quantum phase transitions, offering an order-parameter-free metric that captures ground-state sensitivity to Hamiltonian perturbations and exhibits critical scaling. Classical…
This paper presents a practical computational approach to quantify the effect of individual observations in estimating the state of a system. Such an analysis can be used for pruning redundant measurements, and for designing future sensor…
We present a general setting in which the formula describing the linear response of the physical measure of a perturbed system can be obtained. In this general setting we obtain an algorithm to rigorously compute the linear response. We…
Probabilistic sensitivity analysis identifies the influential uncertain input to guide decision-making. We propose a general sensitivity framework with respect to the input distribution parameters that unifies a wide range of sensitivity…
Recent advances in Rate-Distortion-Perception (RDP) theory highlight the importance of balancing compression level, reconstruction quality, and perceptual fidelity. While previous work has explored numerical approaches to approximate the…
Neural networks, being susceptible to adversarial attacks, should face a strict level of scrutiny before being deployed in critical or adversarial applications. This paper uses ideas from Chaos Theory to explain, analyze, and quantify the…
Diagrammatic techniques to compute perturbatively the spectral properties of Euclidean Random Matrices in the high-density regime are introduced and discussed in detail. Such techniques are developed in two alternative and very different…
We present a high order perturbation approach to quantitatively calculate spectral densities in three distinct steps starting from the model Hamiltonian and the observables of interest. The approach is based on the perturbative continuous…
In distributed-parameter inverse problems in computational mechanics, spatially varying fields are inferred from noisy, indirect, and heterogeneous observations. The relevant identifiability question concerns which spatial perturbation…
We propose a novel reachability analysis method tailored for neural networks with differentiable activations. Our idea hinges on a sound abstraction of the neural network map based on first-order Taylor expansion and bounding the remainder.…