Research
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,742 papers · 148 categories

Trend · papers per month

4590135180 · May 202619922001200920172026
48 results for inverse projection

Proof of convergence for multi-objective optimization using inverse reinforcement learning.

problem Proving convergence in multi-objective optimization problems.
method Wasserstein inverse reinforcement learning with projective subgradient method and gradient descent.
result Convergence of inverse reinforcement learning for multi-objective optimization.

This paper solves the inversion problem for jump processes using Markovian projections.

problem Calibrating jump-diffusion models with both local and stochastic features.
method Inverting Markovian projections for pure jump processes.
result Constructs calibrated local stochastic intensity (LSI) models for credit risk applications.

New method for decomposing high-dimensional parametric domains using PCA and inverse projection.

problem Decomposing high-dimensional parametric domains efficiently.
method Iterative Principal Component Analysis (PCA) and inverse projection methods.
result The proposed method effectively reconstructs the original domain from lower-dimensional data.

Faster reconstruction of compressed signals using conditional GAN and NPGD.

problem Recovering compressed signals from measurements.
method Network-based projected gradient descent (NPGD) combined with measurement-conditional generative adversarial networks (GANs/BEGANs).
result Significant speed-up in reconstruction (up to 140-175 times faster).

A new algorithm speeds up EEG source localization using 1\ell_1 regularization.

problem Challenging inverse problem in mapping EEG readings to brain activity.
method Formulated as a graphical generalized elastic net inverse problem, solved with a variable projected algorithm (VPAL).
result VPAL provides faster and more accurate EEG source localization compared to existing methods.

Proves smooth solutions for generalised Monge-Ampère equations on projective manifolds.

problem Existence of smooth solutions for generalised Monge-Ampère equations on projective manifolds.
method Intersection numbers and degenerate concentration of mass result.
result Proves existence of smooth solutions for generalised Monge-Ampère equations on projective manifolds.

The well-known Funk metric F(x,y) is projectively flat with constant flag curvature K=-1/4 and the Hilbert metric H(x,y):=(F(x,y)+F(x,-y))/2 is projectively flat with constant curvature K=-1. These metrics are the special solutions to Hilbert's Fourth Problem. In this paper, we construct a non-trivial R-flat spray usin…

2001-09-05abs ↗pdf ↗

New algorithm improves signal recovery from noisy measurements with theoretical guarantees.

problem Recovering signals from noisy measurements in inverse problems.
method Wasserstein-based projections (WP) replacing analytic regularization with data-driven denoising.
result WP approximates true projection with high probability, providing theoretical guarantees.

Geometric framework for inverse problems using foliations and dual connections.

problem Reconstruction problems in inverse problems.
method Vaisman foliations and Atiyah--Molino sequences to induce transverse foliations and dual connections.
result Unique, path-independent reconstruction with vanishing torsion and curvature duality.

Paired autoencoders solve inverse problems using latent space projections.

problem Solving inverse problems in scientific computing.
method Paired autoencoder framework that projects data and quantity of interest into a latent space.
result Paired autoencoders generate multiple reconstruction metrics and enable latent-space refinement for accurate data fitting.

We introduce and study a new Radon-like transform that averages projected differential p-forms in R^n over affine (n-k)-planes. We then prove an explicit inversion formula for our transform on the space of rapidly-decaying smooth p-forms. Our transform differs from the one in Gelfand-Graev-Shapiro. Moreover, if it can …

2008-07-22abs ↗pdf ↗

Injectivity of ReLU networks is characterized for generative models and inverse problems.

problem Injectivity in ReLU networks for generative models and inverse problems.
method Layerwise analysis, worst-case Lipschitz constants, differential topology, random projections.
result Global injectivity of ReLU networks requires expansivity between 3.4 and 10.5 for Gaussian matrices.

We propose a new learning-based approach to solve ill-posed inverse problems in imaging. We address the case where ground truth training samples are rare and the problem is severely ill-posed - both because of the underlying physics and because we can only get few measurements. This setting is common in geophysical ima…

2018-05-29abs ↗pdf ↗

Recently the field of inverse problems has seen a growing usage of mathematically only partially understood learned and non-learned priors. Based on first principles, we develop a projectional approach to inverse problems that addresses the incorporation of these priors, while still guaranteeing data consistency. We im…

2019-07-10abs ↗pdf ↗

This paper reviews SDR methods for multivariate response regression.

problem Handling sufficient dimension reduction for multivariate response regression.
method Characterizes SDR estimators as inverse or forward regression methods.
result Pooled marginal, projective resampling, distance-based, ordinary least squares, partial least squares, and semiparametric SDR estimators are discussed.

Researchers extend asymptotic analysis to Bergman projections with Gevrey weights.

problem Analyzing Bergman projections with Gevrey weights.
method Extending direct approach to semiclassical asymptotics to Gevrey weights using Fourier integral operators.
result Gevrey symbol amplitude of asymptotic Bergman projection with Gevrey weights and Gevrey-type growth rate.

The paper studies projections of asset prices under equivalent martingale measures.

problem Understanding the impact of information on asset price bubbles and arbitrage opportunities.
method Analyzes optional projections of local martingales into a smaller filtration under equivalent martingale measures.
result Provides general results and specific examples like inverse Bessel process and stochastic volatility models.

Study of CR twistor model Q2,2Q^{2,2} and its sections.

problem Classify and describe projective lines and hyperplane sections of the CR twistor model.
method Explicit projective methods, classification of lines and sections, use of involution jj.
result Complete relative classification of smooth quadric sections and explicit non-spherical CR structures.

Study on unique generalized Gauss maps of minimal surfaces sharing hypersurfaces in projective varieties.

problem Uniqueness of generalized Gauss maps for minimal surfaces with shared hypersurfaces in projective varieties.
method Analysis of minimal surfaces in Rn+1\mathbb R^{n+1} with inverse images of hypersurfaces in a projective subvariety.
result Generalization and improvement of previous results on the uniqueness of generalized Gauss maps.

Gaussian Markov random fields (GMRFs) are useful in a broad range of applications. In this paper we tackle the problem of learning a sparse GMRF in a high-dimensional space. Our approach uses the l1-norm as a regularization on the inverse covariance matrix. We utilize a novel projected gradient method, which is faster …

2012-06-13abs ↗pdf ↗

C-DPS improves diffusion posterior sampling for inverse problems without projection or likelihood approximation.

problem Inaccurate and unstable solutions in inverse problems due to complex or high-noise conditions.
method C-DPS introduces a forward stochastic process in measurement space evolving in parallel with data-space diffusion, leading to a closed-form posterior.
result C-DPS consistently outperforms existing methods across multiple inverse problem benchmarks.

Efficiently solves inverse problems with diffusion and flow models in just a few steps.

problem Solving inverse problems like super-resolution, inpainting, or deblurring using diffusion or flow models.
method Conditional Conjugate Integrators framework that projects inverse problem dynamics into a more amenable space for sampling.
result Generates high-quality samples in as few as 5 conditional sampling steps, outperforming competing methods.

New method tackles video inverse problems using image diffusion models.

problem Spatio-temporal degradation in video inverse problems.
method Leverages image diffusion models to treat time dimension as batch dimension, introduces batch-consistent diffusion sampling.
result Achieves state-of-the-art reconstructions for various spatio-temporal degradations.

Study of minimal surfaces and their inversion properties in R^n.

problem Properties of complete minimal surfaces with finite total curvature.
method Inversion and conformal compactification to study stationary Willmore energy.
result Exact Willmore index for inverted minimal spheres and real projective planes.

In this paper, we consider Randers change of some special (α,β) (α, β)- metrics. First we find the fundamental metric tensor and Cartan tensor of these Randers changed (α,β) (α, β)- metrics. Next, we establish a general formula for inverse of fundamental metric tensors of these metrics. Finally, we find the necessary and su…

2017-12-21abs ↗pdf ↗

New algorithm improves sparse-view tomography without needing ground-truth data.

problem Poor image reconstructions with sparse projections and non-uniform sensors.
method Unsupervised deep learning with CNN and STN modules.
result Significantly outperforms filtered backprojection in sparse-view scenarios.

Paper projects GP basis functions using tensor networks to reduce complexity.

problem Efficiently approximating Gaussian process regression with a large number of basis functions.
method Develops a method using tensor networks to approximate GP regression with an exponential number of basis functions without exponential computational complexity.
result Shows efficient GP regression on an 18-dimensional benchmark data set.

Variable projection solves structured optimization problems by completely minimizing over a subset of the variables while iterating over the remaining variables. Over the last 30 years, the technique has been widely used, with empirical and theoretical results demonstrating both greater efficacy and greater stability c…

2016-01-19abs ↗pdf ↗

In this paper we develop the theory of Willmore sequences for Willmore surfaces in the 4-sphere. We show that under appropriate conditions this sequence has to terminate. In this case the Willmore surface either is the twistor projection of a holomorphic curve into complex projective space or the inversion of a minimal…

2006-10-21abs ↗pdf ↗

Suppose M be the projective limit of weak symplectic Banach manifolds \{(M_i,φ_{ij})\}_{i,j\in\mathbb N}, where M_i are modeled over reflexive Banach space and σis compatible with the inverse system(defined in the article). We associate to each point x\in M, a Fréchet space H_x(defined in section 3). We prove that if H…

2013-09-06abs ↗pdf ↗

Unified framework recovers exact input from SOM activation patterns.

problem Generating high-dimensional data from Self-Organizing Maps (SOMs).
method Inverting SOM activation patterns to recover input, using linear system and Tikhonov regularization.
result MUSIC framework produces coherent semantic transitions and maintains high classifier confidence.