The subtle and unique imprint of dark matter substructure on extended arcs in strong lensing systems contains a wealth of information about the properties and distribution of dark matter on small scales and, consequently, about the underlying particle physics. However, teasing out this effect poses a significant challe…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “strong lensing”
Method generates joint posterior samples of source and foreground mass distributions for gravitational lensing.
problem Challenging inference problem for high-resolution, high signal-to-noise ratio gravitational lensing.
method Combines diffusion-based generative modeling and recurrent inference machines.
result Can model realistic gravitational lensing simulations down to the noise level.
In the Friedmann Model of the universe, cosmologists assume that spacelike slices of the universe are Riemannian manifolds of constant sectional curvature. This assumption is justified via Schur's Theorem by stating that the spacelike universe is locally isotropic. Here we define a Riemannian manifold as almost locally…
Weak lensing maps contain information beyond two-point statistics on small scales. Much recent work has tried to extract this information through a range of different observables or via nonlinear transformations of the lensing field. Here we train and apply a 2D convolutional neural network to simulated noiseless lensi…
Machine learning detects subhalos in lensed images with high accuracy and low false positives.
problem Detecting substructure in strongly lensed images.
method Developed a neural network for image segmentation to locate and mass estimate subhalos.
result The network can detect subhalos with masses and measure the subhalo mass function.
New equations reveal how cylinder power in progressive lenses depends on geodesic curvature.
problem Current understanding of cylinder power in progressive lenses is incomplete.
method Derived complete compatibility equations for spatially-varying curvature surfaces.
result Cylinder power depends on geodesic curvature, not just principal curvature.
ResUNet-CMB neural network reconstructs CMB effects from noisy data.
problem Reconstructing CMB anisotropies from noisy data.
method Convolutional neural network (ResUNet-CMB) for simultaneous reconstruction of lensing and reionization.
result ResUNet-CMB outperforms quadratic estimators at low noise levels and avoids lensing-induced bias.
Estimates how many times a star appears due to gravitational lensing.
problem Estimating the number of times an observer sees a star due to gravitational lensing.
method Use affine linking numbers to estimate the number of times an observer sees a star.
result Estimates the number of times an observer sees a star due to gravitational lensing.
Enhances weak lensing inference with neural summaries.
problem Extracting additional information from weak lensing convergence maps.
method Hybrid approach combining physics-based and neural summaries.
result Neural summaries extract up to 8 times more information than angular power spectra.
DeepCMB: Lensing Reconstruction of the Cosmic Microwave Background with Deep Neural Networksastro-ph.CO
Next-generation cosmic microwave background (CMB) experiments will have lower noise and therefore increased sensitivity, enabling improved constraints on fundamental physics parameters such as the sum of neutrino masses and the tensor-to-scalar ratio r. Achieving competitive constraints on these parameters requires hig…
Paper uses ResUNet-CMB to reconstruct cosmic polarization rotation from CMB data.
problem Reconstructing anisotropic cosmic polarization rotation from CMB data.
method Extended ResUNet-CMB to handle gravitational lensing and patchy reionization.
result ResUNet-CMB outperforms standard quadratic estimator in reconstructing all three effects.
Deep learning helps remove secondary -mode polarization to detect primordial gravitational waves.
problem Removing secondary -mode polarization from CMB data to detect primordial gravitational waves.
method Applied deep learning (ResUNet-CMB) to estimate and remove multiple sources of secondary -mode polarization.
result Deep learning can produce nearly optimal, unbiased estimates of the amplitude of primordial gravitational waves.
We demonstrate the potential of Deep Learning methods for measurements of cosmological parameters from density fields, focusing on the extraction of non-Gaussian information. We consider weak lensing mass maps as our dataset. We aim for our method to be able to distinguish between five models, which were chosen to lie …
The modulation transfer function (MTF) is widely used to characterise the performance of optical systems. Measuring it is costly and it is thus rarely available for a given lens specimen. Instead, MTFs based on simulations or, at best, MTFs measured on other specimens of the same lens are used. Fortunately, images reco…
We provide a geometric explanation for the existence of magnification relations for the A, D, E family of caustic singularities, which were established in recent work. In particular, it was shown that for families of general mappings between planes exhibiting any of these caustic singularities, and for any non-caustic …
We propose a deep-learning approach based on generative adversarial networks (GANs) to reduce noise in weak lensing mass maps under realistic conditions. We apply image-to-image translation using conditional GANs to the mass map obtained from the first-year data of Subaru Hyper Suprime-Cam (HSC) survey. We train the co…
New emulator bridges simulators using conditional optimal transport.
problem Bridging simulators with minimal distortion.
method Flow-based approach to learn likelihood transport, COT-FM for optimal matching.
result Emulator accurately captures full correction between simulators.
Co-eye: A Multi-resolution Symbolic Representation to TimeSeries Diversified Ensemble Classificationcs.LG
Co-eye combines multiple symbolic representations to improve time series classification accuracy.
problem Challenges in time series classification due to domain diversity.
method Inspired by compound eyes, Co-eye uses multiple symbolic representations and hyper-parameterised lenses to classify time series data.
result Co-eye outperforms state-of-the-art techniques in accuracy and robustness across various domains.
Unified approach for sample aggregation in transfer learning across various divergence measures.
problem Optimizing sample aggregation from source to target distributions for improved target performance.
method Unified algorithmic approach that adapts to multiple divergence measures via a weak modulus of transfer.
result Unified approach achieves near optimal rates in terms of the unknown strong modulus, applicable in more general settings.
Painting with baryons: augmenting N-body simulations with gas using deep generative modelsastro-ph.CO
Running hydrodynamical simulations to produce mock data of large-scale structure and baryonic probes, such as the thermal Sunyaev-Zeldovich (tSZ) effect, at cosmological scales is computationally challenging. We propose to leverage the expressive power of deep generative models to find an effective description of the l…
First we review the definition of a negative point mass singularity. Then we examine the gravitational lensing effects of these singularities in isolation and with shear and convergence from continuous matter. We review the Inverse Mean Curvature Flow and use this flow to prove some new results about the mass of a sing…
We pursue a geometrical approach to gravitational lensing theory. We present a survey of the background theory of General Relativity, including particular properties of the Schwarzschild and Kerr solutions. Next we outline a proof of the Gauss Bonnet theorem and its applications to surfaces in optical geometry, as deve…
In general relativity, spatial light rays of static spherically symmetric spacetimes are geodesics of surfaces in Riemannian optical geometry. In this paper, we apply results on the isoperimetric problem to show that length-minimizing curves subject to an area constraint are circles, and discuss implications for the ph…
Around Vogt's theoremmath.DG
Vogt's theorem, concerning boundary angles of a convex arc with monotonic curvature (spiral arc), is taken as a starting point to establish basic properties of spirals. The theorem is expanded by removing requirements of convexity and curvature continuity; the cases of inflection and multiple windings are considered. P…
We explore the perspective of a bug living on the two-dimensional surface of a polyhedron. Images of various kinds of effects like lensing and cloaking are shown via color pictures of three viewpoints: the first person perspective of the bug, a map of the bug's viewpoint, and a look at the bug on the embedded polyhedro…
Study stability of selective SSMs with discontinuous gating.
problem Challenges in stability analysis of selective SSMs with discontinuous gating.
method Passivity and Input-to-State Stability (ISS) analysis of continuous-time selective SSMs.
result Derivation of sufficient conditions for global ISS with respect to the port input.
Evidence Networks simplify Bayesian model comparison for complex models.
problem Bayesian model comparison challenges with intractable likelihoods or priors.
method Loss functions and neural networks for fast, amortized estimation of Bayes factors.
result Evidence Networks provide accurate and scalable Bayes factor estimation.
New system studies trapped light paths in Euclidean space.
problem Trapping of light paths in Euclidean space with negative refractive index.
method Introduces wind-tree tiling billiards system to study trajectories of rays in Euclidean space with rectangular obstacles.
result Almost every configuration of the system traps trajectories with initial vertical direction in an infinite strip.
TopoFisher learns topological summaries by maximizing Fisher information, improving parameter efficiency and inference quality.
problem Simulation-based inference misses key information in low-order statistics, especially for non-Gaussian fields.
method TopoFisher uses a differentiable persistent-homology pipeline that learns topological summaries by maximizing local Gaussian Fisher information.
result TopoFisher recovers much of the available information and outperforms fixed topological vectorizations in weak gravitational lensing.
We give a characterization of critical points that allows us to define a metric invariant on all Riemannian manifolds with a lower sectional curvature bound and an upper radius bound. We show there is a uniform upper volume bound for all such manifolds with an upper bound on this invariant. We generalize results by…
We study the problem of identifying different behaviors occurring in different parts of a large heterogenous network. We zoom in to the network using lenses of different sizes to capture the local structure of the network. These network signatures are then weighted to provide a set of predicted labels for every node. W…
Dynamic SBI improves SBI efficiency without rounds, reducing simulation and training costs.
problem Efficiently perform complex scientific inference with high-dimensional data.
method Adaptive dataset transformation, parallel simulation and training.
result Significant improvements in simulation and training efficiency.
We propose flow-based likelihoods to accurately capture non-Gaussian data.
problem Bypassing the Gaussian assumption in scientific analyses.
method Use optimization targets of flow-based generative models to reconstruct likelihoods.
result Flow-based likelihoods can accurately capture non-Gaussian data, improving parameter constraints.
Distributionally robust optimization (DRO) has attracted attention in machine learning due to its connections to regularization, generalization, and robustness. Existing work has considered uncertainty sets based on phi-divergences and Wasserstein distances, each of which have drawbacks. In this paper, we study DRO wit…
New model reduces bias in cosmic shear measurements.
problem Bias in cosmic shear measurements due to non-well-defined ellipticity.
method Hybrid physical and deep learning Hierarchical Bayesian Model.
result Unbiased estimate of shear on realistic galaxies.
New black hole solutions with lens space horizons in 5D Kaluza-Klein theory.
problem Finding black hole solutions with specific horizon topologies.
method Formally asymptotically flat black hole solutions constructed through Kaluza-Klein reduction.
result Explicit construction of regular black hole solutions with horizons.
In this paper, we show that popular Generative Adversarial Networks (GANs) exacerbate biases along the axes of gender and skin tone when given a skewed distribution of face-shots. While practitioners celebrate synthetic data generation using GANs as an economical way to augment data for training data-hungry machine lea…
We study the problem of asymptotically flat bi-axially symmetric stationary solutions of the vacuum Einstein equations in -dimensional spacetime. In this setting, the cross section of any connected component of the event horizon is a prime -manifold of positive Yamabe type, namely the -sphere , the ring $…
Reinterprets Granger causality with causal Bayesian networks and Reichenbach's principles.
problem Lack of a rigorous causal foundation in Granger causality.
method Reinterpreting Granger causality through Reichenbach's principles and causal Bayesian networks, implementing as c-GC.
result c-GC provides a more principled framework for causal discovery in observational datasets.
Forging new worlds: high-resolution synthetic galaxies with chained generative adversarial networksastro-ph.IM
Astronomy of the 21st century increasingly finds itself with extreme quantities of data. This growth in data is ripe for modern technologies such as deep image processing, which has the potential to allow astronomers to automatically identify, classify, segment and deblend various astronomical objects. In this paper, w…
Increasing the batch size is a popular way to speed up neural network training, but beyond some critical batch size, larger batch sizes yield diminishing returns. In this work, we study how the critical batch size changes based on properties of the optimization algorithm, including acceleration and preconditioning, thr…
Program Synthesis for Simulation-Based Inference: Joint Model Selection and Parameter Estimationcs.LG
Framework synthesizes programs for simulating complex models and estimating parameters.
problem Parameter estimation for complex models requires manual encoding of fixed model structures.
method Combines LLMs for program synthesis with neural simulation-based inference.
result Identifies plausible model families from open-ended prompts with high accuracy.
The study improves genus 1 bridge number bounds for satellite knots.
problem Improving bounds on genus 1 bridge number for satellite knots.
method Generalizes and proves new bounds for genus 0 and 1 bridge numbers.
result Shows for non-torus companion knots.
By using Stationary-to-Randers correspondence (SRC), a characterization of light and time-convexity of the boundary of a region of a standard stationary (n+1)-spacetime is obtained, in terms of the convexity of the boundary of a domain in a Finsler n or (n+1)-space of Randers type. The latter convexity is analyzed in d…
Data integration methods that analyze multiple sources of data simultaneously can often provide more holistic insights than can separate inquiries of each data source. Motivated by the advantages of data integration in the era of "big data", we investigate feature selection for high-dimensional multi-view data with mix…
Introduces CSLC models to bridge deep generative models and classical algorithms.
problem Mode collapse and memorization issues in deep generative models and restrictive assumptions in classical algorithms.
method Introduces conditionally strongly log-concave (CSLC) models, factorizing data distribution into strongly log-concave conditional distributions.
result Efficient parameter estimation and sampling algorithms with theoretical guarantees for non-log-concave data distributions.
Combines BO with context to optimize binary feedback.
problem Optimizing expensive binary functions with context.
method Bayesian active learning and optimization.
result Efficiently chooses best context and parameters.
Imitation learning can reproduce policies by observing experts, which poses a problem regarding policy privacy. Policies, such as human, or policies on deployed robots, can all be cloned without consent from the owners. How can we protect against external observers cloning our proprietary policies? To answer this quest…