arXiv subjects

Gaurav Arya

Publications and source records attributed to Gaurav Arya.

9 recordsLinked to original sources

arXiv2026

GradInf: Gradient Estimation as Probabilistic Inference

Gradient estimation -- the task of computing the gradient of the expected value of a probabilistic program -- has diverse applications in scientific computing, but is notoriously difficult because of issues such as high-dimensional integration, discrete random choices, and complex stochastic dependencies. This article introduces gradient inference, a new approach to developing sound and efficient gradient estimators for probabilistic programs. Gradient inference rests on a formal reduction from a gradient estimation problem to a closely related probabilistic inference problem, whose solution can be differentiated to obtain a gradient estimator. This inference problem is obtained by applying two powerful statistical operations -- coupling and factorization -- to the input probabilistic program. Our reduction lets us leverage the rich toolkit of probabilistic inference algorithms to design novel gradient estimators that extend and improve upon existing methods. We introduce GradInf, a probabilistic programming system that facilitates the sound and automated implementation of gradient inference. GradInf is centered around programmable source-to-source transformations for coupling and factorizing higher-order probabilistic programs, whose soundness is proven in terms of a denotational semantics. Key to our development is the use of information-flow typing to allow random choices in a probabilistic program to be factored out and partially evaluated, which improves our ability to deploy sophisticated probabilistic inference algorithms. The resulting system offers practitioners a principled framework for designing gradient estimators. We apply GradInf to several challenging case studies, showing that it can express prominent gradient estimators from the literature and enables the construction of new state-of-the-art estimators that outperform the best existing baselines.

cs.PL↗

arXiv2025

Modular programming of interaction and geometric specificity enables assembly of complex DNA origami nanostructures

We present a modular DNA origami design approach to address the challenges of assembling geometrically complex nanoscale structures, including those with nonuniform Gaussian curvature. This approach features a core structure that completely conserves the scaffold routing across different designs and preserves more than 70% of the DNA staples between designs, dramatically reducing both cost and effort, while enabling precise and independent programming of subunit interactions and binding angles through adjustable overhang lengths and sequences. Using cryogenic electron microscopy, gel electrophoresis, and coarse-grained molecular dynamics simulations, we validate a set of robust design rules. We demonstrate the method's utility by assembling a variety of self-limiting structures, including anisotropic shells with controlled inter-subunit interactions and curvature, and a toroid with globally varying curvature. Our strategy is both cost-effective and versatile, providing a promising and efficient solution for the synthetic fabrication of complex nanostructures.

cond-mat.soft↗

arXiv2024

End-to-end metasurface design for temperature imaging via broadband Planck-radiation regression

We present a theoretical framework for temperature imaging from long-wavelength infrared thermal radiation (e.g. 8-12 $\mu$m) through the end-to-end design of a metasurface-optics frontend and a computational-reconstruction backend. We introduce a new nonlinear reconstruction algorithm, ``Planck regression," that reconstructs the temperature map from a grayscale sensor image, even in the presence of severe chromatic aberration, by exploiting blackbody and optical physics particular to thermal imaging. We combine this algorithm with an end-to-end approach that optimizes a manufacturable, single-layer metasurface to yield the most accurate reconstruction. Our designs demonstrate high-quality, noise-robust reconstructions of arbitrary temperature maps (including completely random images) in simulations of an ultra-compact thermal-imaging device. We also show that Planck regression is much more generalizable to arbitrary images than a straightforward neural-network reconstruction, which requires a large training set of domain-specific images.

physics.optics↗

arXiv2024

End-to-End Optimization of Metasurfaces for Imaging with Compressed Sensing

We present a framework for the end-to-end optimization of metasurface imaging systems that reconstruct targets using compressed sensing, a technique for solving underdetermined imaging problems when the target object exhibits sparsity (i.e. the object can be described by a small number of non-zero values, but the positions of these values are unknown). We nest an iterative, unapproximated compressed sensing reconstruction algorithm into our end-to-end optimization pipeline, resulting in an interpretable, data-efficient method for maximally leveraging metaoptics to exploit object sparsity. We apply our framework to super-resolution imaging and high-resolution depth imaging with a phase-change material. In both situations, our end-to-end framework computationally discovers optimal metasurface structures for compressed sensing recovery, automatically balancing a number of complicated design considerations to select an imaging measurement matrix from a complex, physically constrained manifold with millions ofdimensions. The optimized metasurface imaging systems are robust to noise, significantly improving over random scattering surfaces and approaching the ideal compressed sensing performance of a Gaussian matrix, showing how a physical metasurface system can demonstrably approach the mathematical limits of compressed sensing.

eess.IV↗

arXiv2024

Gradient Estimation via Differentiable Metropolis-Hastings

Metropolis-Hastings estimates intractable expectations - can differentiating the algorithm estimate their gradients? The challenge is that Metropolis-Hastings trajectories are not conventionally differentiable due to the discrete accept/reject steps. Using a technique based on recoupling chains, our method differentiates through the Metropolis-Hastings sampler itself, allowing us to estimate gradients with respect to a parameter of otherwise intractable expectations. Our main contribution is a proof of strong consistency and a central limit theorem for our estimator under assumptions that hold in common Bayesian inference problems. The proofs augment the sampler chain with latent information, and formulate the estimator as a stopping tail functional of this augmented chain. We demonstrate our method on examples of Bayesian sensitivity analysis and optimizing a random walk Metropolis proposal.

math.ST↗

arXiv2023

Differentiating Metropolis-Hastings to Optimize Intractable Densities

We develop an algorithm for automatic differentiation of Metropolis-Hastings samplers, allowing us to differentiate through probabilistic inference, even if the model has discrete components within it. Our approach fuses recent advances in stochastic automatic differentiation with traditional Markov chain coupling schemes, providing an unbiased and low-variance gradient estimator. This allows us to apply gradient-based optimization to objectives expressed as expectations over intractable target densities. We demonstrate our approach by finding an ambiguous observation in a Gaussian mixture model and by maximizing the specific heat in an Ising model.

stat.ML↗

arXiv2023

Transcending shift-invariance in the paraxial regime via end-to-end inverse design of freeform nanophotonics

Traditional optical elements and conventional metasurfaces obey shift-invariance in the paraxial regime. For imaging systems obeying paraxial shift-invariance, a small shift in input angle causes a corresponding shift in the sensor image. Shift-invariance has deep implications for the design and functionality of optical devices, such as the necessity of free space between components (as in compound objectives made of several curved surfaces). We present a method for nanophotonic inverse design of compact imaging systems whose resolution is not constrained by paraxial shift-invariance. Our method is end-to-end, in that it integrates density-based full-Maxwell topology optimization with a fully iterative elastic-net reconstruction algorithm. By the design of nanophotonic structures that scatter light in a non-shift-invariant manner, our optimized nanophotonic imaging system overcomes the limitations of paraxial shift-invariance, achieving accurate, noise-robust image reconstruction beyond shift-invariant resolution.

physics.optics↗

arXiv2023

Automatic Differentiation of Programs with Discrete Randomness

Automatic differentiation (AD), a technique for constructing new programs which compute the derivative of an original program, has become ubiquitous throughout scientific computing and deep learning due to the improved performance afforded by gradient-based optimization. However, AD systems have been restricted to the subset of programs that have a continuous dependence on parameters. Programs that have discrete stochastic behaviors governed by distribution parameters, such as flipping a coin with probability $p$ of being heads, pose a challenge to these systems because the connection between the result (heads vs tails) and the parameters ($p$) is fundamentally discrete. In this paper we develop a new reparameterization-based methodology that allows for generating programs whose expectation is the derivative of the expectation of the original program. We showcase how this method gives an unbiased and low-variance estimator which is as automated as traditional AD mechanisms. We demonstrate unbiased forward-mode AD of discrete-time Markov chains, agent-based models such as Conway's Game of Life, and unbiased reverse-mode AD of a particle filter. Our code package is available at https://github.com/gaurav-arya/StochasticAD.jl.

cs.LG↗

arXiv2004

Monte Carlo study of shear-induced alignment of cylindrical micelles in thin films

The behavior of confined cylindrical micelle-forming surfactants under the influence of shear has been investigated using Monte Carlo simulations. The surfactants are modeled as coarse-grained lattice polymers, while the Monte Carlo shear flow is implemented with an externally imposed potential energy field which induces a linear drag velocity on the surfactants. It is shown that in the absence of shear, cylindrical micelles confined within a monolayer coarsen gradually with Monte Carlo "time" t, the persistence length of the micelles scaling as t^{0.24}, in agreement with the scaling obtained experimentally. Under the imposition of shear, the micelles within a monolayer align parallel to the direction of shear, as observed experimentally. Micelles confined within thicker films also align parallel to each other with a hexagonal packing under shear, but assume a finite tilt with respect to the velocity vector within the velocity-velocity gradient plane. We propose a novel mechanism for this shear-induced alignment of micelles based on breaking up of micelles aligned perpendicular to shear and their reformation and subsequent growth in the shear direction. It is observed that there exists a "window" of shear rates within which such alignment occurs. A phenomenological theory proposed to explain the above behavior is in good agreement with simulation results. A comparison of simulated and experimental self-diffusivities yields a physical timescale for Monte Carlo moves, which enables an assessment of the physical shear rates employed in our Monte Carlo simulations.

cond-mat.soft↗