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.

169,042 papers · 148 categories

Trend · papers per month

96192288384 · Jun 202019922001200920172026
48 results for Learning-based Variation Operators

PDERL improves evolutionary reinforcement learning by using learning-based variation operators.

problem Scalability issue in Genetic Algorithms when combined with Deep Neural Networks.
method Integrates evolutionary and reinforcement learning through a hierarchical approach with learning-based variation operators.
result PDERL outperforms traditional evolutionary and reinforcement learning methods in robot locomotion tasks.

Variational inference is an umbrella term for algorithms which cast Bayesian inference as optimization. Classically, variational inference uses the Kullback-Leibler divergence to define the optimization. Though this divergence has been widely used, the resultant posterior approximation can suffer from undesirable stati…

2016-10-27abs ↗pdf ↗

We derive the first and second variation formula for the Green's function pole's value of Paneitz operator on the standard three sphere. In particular it is shown that the first variation vanishes and the second variation is nonpositively definite. Moreover, the second variation vanishes only at the direction of confor…

2015-04-08abs ↗pdf ↗

We develop a probabilistic framework for deep learning based on the Deep Rendering Mixture Model (DRMM), a new generative probabilistic model that explicitly capture variations in data due to latent task nuisance variables. We demonstrate that max-sum inference in the DRMM yields an algorithm that exactly reproduces th…

2016-12-06abs ↗pdf ↗

Study uses machine learning to solve photoacoustic tomography's inverse problem.

problem Solving the full inverse problem in photoacoustic tomography.
method Developed an approach using variational autoencoders for Bayesian estimation of the posterior distribution.
result Evaluated the approach with numerical simulations and compared it to a Bayesian solution.

A strategy for spectrum sharing in CRNs with multiple PT power levels.

problem Efficient spectrum usage for secondary users in CRNs with multiple PT power levels.
method Data-driven/machine learning based multi-level spectrum sensing and prediction-transmission structures.
result The proposed strategy effectively aligns the ST with the PT power levels, improving spectrum usage.

Study efficient neural operator learning using variation spaces.

problem Operator learning using encoder-decoder neural networks.
method Introduce variation space for nonlinear operators, establish approximation bounds.
result Algebraic approximation and learning rates for polynomially decaying input and output encoding errors.

This paper bridges statistical and machine learning approaches to variational inference.

problem Statisticians struggle to understand variational inference from a Frequentist perspective.
method Explains VI, VAEs, and DDMs from a Frequentist viewpoint, starting with EM.
result VI emerges as a scalable solution for intractable E-steps in VAEs and DDMs.

For a scalar evolution equation ut=K(t,x,u,ux,,un),n2u_t=K(t,x,u,u_x,\ldots, u_n), n\geq 2 the cohomology spaces H1,s(R)H^{1,s}({\mathcal R}^\infty) vanishes for s3s\geq 3 while the space H1,2(R)H^{1,2}({\mathcal R}^\infty) is isomorphic to the space of variational operators. The cohomology space H1,2(R)H^{1,2}({\mathcal R}^\infty) is also shown to be …

2019-02-08abs ↗pdf ↗

D-GAN predicts spatio-temporal data without explicit factor listing.

problem Challenges in predicting spatio-temporal data due to complexity, variability, and external factors.
method D-GAN uses a deep generative adversarial network to learn spatio-temporal correlations and variations implicitly.
result D-GAN outperforms traditional and deep learning methods in spatio-temporal prediction accuracy.

GeoFunFlow tackles inverse problems on complex geometries with efficient learning.

problem Challenges in inverse problems governed by PDEs, especially on irregular geometries.
method Combines geometric function autoencoder and latent diffusion model trained via rectified flow.
result Achieves state-of-the-art reconstruction accuracy and efficient inference.

This paper learns variational models and solvers for inverse problems from incomplete data.

problem Solving inverse problems with partially observed data.
method Joint learning of variational cost and gradient-based solver as neural networks.
result Joint learning leads to improved reconstruction performance.

Study on eigenvalues of complex Hessian operator on pseudoconvex manifolds.

problem Eigenvalue problem for complex Hessian operator on pseudoconvex manifolds.
method Established C1,1C^{1,1}-regularity and uniqueness of the first eigenfunction, derived variational formula for the first eigenvalue.
result Derivation of a bifurcation-type theorem and geometric bounds for the eigenvalue.

The paper explores how control variates can reduce variance in Monte Carlo simulations, especially for Sobolev functions.

problem Efficiency of control variates in reducing variance for Monte Carlo simulations.
method Study of a specific quadrature rule using nonparametric regression-adjusted control variates.
result A specific quadrature rule can improve the Monte Carlo rate and achieve the minimax optimal rate under sufficient smoothness assumptions.

New deep learning method solves TSP faster and more efficiently.

problem Approximately solving the Travelling Salesman Problem on 2D Euclidean graphs.
method Uses Graph Convolutional Networks for efficient TSP graph representations and non-autoregressive beam search.
result Significantly reduces optimality gap for large problem instances.

Harmonic gauge simplifies geometric analysis of Riemannian metrics.

problem Analyzing the Hilbert-Einstein functional and its stability.
method Developed a harmonic gauge to eliminate divergence terms and induce elliptic structure.
result Positivity of curvature operator implies spectral stability of the functional.

Study fourth-order geometric flow of shape operator for co-dimension one immersions.

problem Analyzing the geometry of isometric immersions in Riemannian manifolds.
method Introduce a moduli flow to decrease curvature variation energy.
result The flow decreases a natural energy measuring curvature variation.

Enhanced DeepONet framework with uncertainty quantification for complex operators.

problem Learning complex operators with uncertainty quantification.
method Generalised variational inference (GVI) using Rényi's α-divergence.
result Superior predictive accuracy and uncertainty quantification.

Variational methods yield formulas for eigenvalues of elliptic operators, with applications to metric evolution.

problem Deriving formulas for eigenvalues of elliptic operators on compact manifolds.
method Variational methods applied to elliptic operators on compact Riemannian manifolds.
result Generic subsets of metrics yield simple spectra of elliptic operators.

In this paper we provide a detailed proof of the second variation formula, essentially due to Richard Hamilton, Tom Ilmanen and the first author, for Perelman's νν-entropy. In particular, we correct an error in the stability operator stated in Theorem 6.3 of [2]. Moreover, we obtain a necessary condition for linearly …

2010-08-04abs ↗pdf ↗

InClass nets use neural networks to estimate CIMMs without assuming fixed parameters.

problem Nonparametric estimation of conditional independence mixture models.
method Independent classifier neural networks (NNs) for multi-class classification.
result Nonparametric identifiability conditions for bivariate CIMMs.

New method accelerates energetic variational inference using particle dynamics.

problem Efficiently solving variational inference problems with reduced computational cost.
method Particle-based variational inference with implicit scheme, inspired by energy quadratization and operator splitting.
result Significantly reduces computational cost compared to existing methods.

Constructs Lepage equivalents for arbitrary-order Lagrangians.

problem Creating Lepage equivalents for complex Lagrangians.
method Uses variational bicomplex and symmetric linear connections to construct Lepage equivalents satisfying the closure property.
result Shows how to extend global Lepage equivalents to ones satisfying the closure property.

We introduce a learning-based framework to optimize tensor programs for deep learning workloads. Efficient implementations of tensor operators, such as matrix multiplication and high dimensional convolution, are key enablers of effective deep learning systems. However, existing systems rely on manually optimized librar…

2018-05-21abs ↗pdf ↗

A new method solves variational inequality problems with multiple constraints without needing optimal Lagrange multipliers.

problem Solving variational inequality problems with multiple functional constraints efficiently.
method Constrained Gradient Method (CGM) for Minty variational inequality problems.
result The Constrained Gradient Method achieves complexity similar to projection-based methods but with cheaper oracles.

We first generalize the operation of formal exterior differential in the case of finite dimensional fibered manifolds and then we extend it to certain bundles of smooth maps. In order to characterize the operator order of some morphisms between our bundles of smooth maps, we introduce the concept of fiberwise (k,r)(k,r)-j…

2004-07-19abs ↗pdf ↗

Develops inference combinators for probabilistic programs using neural networks.

problem Creating efficient proposals for probabilistic program inference.
method Inference combinators using neural network parameterization of proposals.
result Correct by construction variational methods tailored to specific models.

Defines a filtration on variational bicomplex for concise functional form conditions.

problem Expressing functional form vanishing conditions concisely.
method Introduces a filtration on the variational bicomplex and studies its properties.
result Graded components of the filtration inherit module structures, simplifying functional form conditions.