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

Trend · papers per month

67135202269 · Jun 202019922001200920172026
48 results for square potential

Study on heat flow across two half-lines with special boundary conditions.

problem Low energy mode of heat flow transmission across a Grushin-type cylinder.
method Analysis of heat equation with inverse-square potential and bridging boundary conditions.
result First insight into qualitative features of the heat flow solution at later times.

Develops methods to learn correlation potentials for time-dependent Kohn-Sham systems.

problem Learning the correlation potential for time-dependent Kohn-Sham systems.
method Optimizing a least-squares objective subject to the TDKS equation using adjoints.
result Learned correlation potential models match ground truth electron densities and can have memory.

LMC algorithm converges to target in Chi-squared and Renyi divergence.

problem Sampling from target distribution using LMC with strong dissipativity and smoothness conditions.
method LMC algorithm with strong dissipativity and first-order smoothness, initialized with Gaussian.
result LMC reaches ε-neighborhood of target in Chi-squared and Renyi divergence in O(λ²dε⁻¹) steps.

Ordinary least squares (OLS) is the default method for fitting linear models, but is not applicable for problems with dimensionality larger than the sample size. For these problems, we advocate the use of a generalized version of OLS motivated by ridge regression, and propose two novel three-step algorithms involving l…

2015-06-07abs ↗pdf ↗

Sharp risk bounds for early-stopping in Gaussian linear regression are derived.

problem Minimizing in-sample mean squared error in high-dimensional Gaussian linear regression.
method Early-stopped mirror descent (ESMD) with local Gaussian width bounds.
result Sharp risk bounds extend to early-stopped mirror descent for least squares estimator (LSE).

Machine learning can improve 2SLS first stage predictions, but nonlinear methods often introduce bias.

problem Improving the first stage of 2SLS using machine learning.
method Decomposed bias into three components, investigated through simulation.
result Nonlinear machine learning methods can introduce substantial bias in second-stage estimates.

In this work we propose an adversarial learning approach to generate high resolution MRI scans from low resolution images. The architecture, based on the SRGAN model, adopts 3D convolutions to exploit volumetric information. For the discriminator, the adversarial loss uses least squares in order to stabilize the traini…

2018-12-29abs ↗pdf ↗

Study optimal transport on globally hyperbolic spacetimes, focusing on weak Kantorovich potentials' regularity.

problem Investigate regularity of weak Kantorovich potentials on globally hyperbolic spacetimes.
method Apply insights from Riemannian and Lorentzian cases to study ππ-solutions.
result Conclude existence, uniqueness, and structure of optimal transport maps.

Feature selection is a technique to screen out less important features. Many existing supervised feature selection algorithms use redundancy and relevancy as the main criteria to select features. However, feature interaction, potentially a key characteristic in real-world problems, has not received much attention. As a…

2012-10-06abs ↗pdf ↗

New algorithm reduces bias and variance in weighted least-squares solutions.

problem Inconsistent linear least-squares problems with rapidly decaying singular values.
method Regularized block Kaczmarz (ReBlocK) algorithm.
result ReBlocK outperforms RBK and minibatch SGD for inconsistent problems.

In this article, we propose a new algorithm for supervised learning methods, by which one can both capture the non-linearity in data and also find the best subset model. To produce an enhanced subset of the original variables, an ideal selection method should have the potential of adding a supplementary level of regres…

2017-01-19abs ↗pdf ↗

Study on Wasserstein gradient flow for MMD between Coulomb measures.

problem Analyzing the long-time behavior of MMD between probability and target measures using Coulomb kernels.
method Existence of global weak solutions, ultracontractive estimate, regularity analysis, exponential decay proof, defective Polyak-Lojasiewicz inequality.
result Exponential decay of squared MMD toward a uniformly positive target measure on flat torus.

Quaternionic analysis proves minimum of Willmore functional on Riemann surfaces.

problem Finding minimum of Willmore functional on Riemann surfaces.
method Extending quaternionic analysis to weakly conformal maps and using Darboux transformation.
result Minimum of Willmore functional on Riemann surfaces is achieved by weakly conformal maps.

There is some theoretical evidence that deep neural networks with multiple hidden layers have a potential for more efficient representation of multidimensional mappings than shallow networks with a single hidden layer. The question is whether it is possible to exploit this theoretical advantage for finding such represe…

2019-07-19abs ↗pdf ↗

We extend the Feynman-Kac formula for Schrödinger type operators on vector bundles over noncompact Riemannian manifolds to possibly very singular potentials that appear in hydrogen like quantum mechanical problems and that need not be bounded from below or locally square integrable. This path integral formula is then u…

2011-09-01abs ↗pdf ↗

A holomorphy potential is a complex valued function whose complex gradient, with respect to some Kähler metric, is a holomorphic vector field. Given kk holomorphic vector fields on a compact complex manifold, form, for a given Kähler metric, a product of the following type: a function of the scalar curvature multiplie…

2008-04-29abs ↗pdf ↗

Improved robust regression for heavy-tailed and contaminated data.

problem Linear regression with heavy-tailed and adversarially contaminated covariates and responses.
method Applying a filtering algorithm to covariates and then using Huber regression, least trimmed squares, or least absolute deviation estimators on the remaining data.
result Near-optimal error rates achieved for the Huber regression estimator.

Efficiently predicts optimal transport plans using sliced potentials.

problem Predicting optimal transport plans across multiple measure pairs efficiently.
method Regression-based and objective-based amortization strategies using sliced optimal transport potentials.
result Efficient and accurate prediction of optimal transport plans for various tasks.

The purpose of this paper is to study geometrically simply-connected homotopy 4-spheres by analyzing nn-component links with a Dehn surgery realizing #n(S1×S2)\#^n(S^1\times S^2). We call such links nnR-links. Our main result is that a homotopy 4-sphere that can be built without 1-handles and with only two 2-handles is diff…

2019-04-17abs ↗pdf ↗

In this paper we investigate panel regression models with interactive fixed effects. We propose two new estimation methods that are based on minimizing convex objective functions. The first method minimizes the sum of squared residuals with a nuclear (trace) norm regularization. The second method minimizes the nuclear …

2018-10-25abs ↗pdf ↗

R. Schwartz's inequality provides an upper bound for the Schwarzian derivative of a parameterization of a circle in the complex plane and on the potential of Hill's equation with coexisting periodic solutions. We prove a discrete version of this inequality and obtain a version of the planar Blaschke-Santalo inequality …

2010-06-07abs ↗pdf ↗

Zigzag sampling algorithm efficiently samples from strongly log-concave distributions with low computational cost.

problem Sampling from strongly log-concave distributions efficiently and with low computational complexity.
method Zigzag sampling algorithm with warm start assumption, focusing on gradient evaluations.
result Achieves ε error in chi-square divergence with computational cost of O(κ²d^(1/2)(log(1/ε))^(3/2)) gradient evaluations.

ADMM algorithm solves nonlinear matrix decompositions efficiently.

problem Nonlinear matrix decompositions for various applications.
method Alternating Direction Method of Multipliers (ADMM) for nonlinear matrix factorization.
result The method efficiently solves diverse nonlinear matrix decompositions.

Improved real-time UAV terrain following with RVM-RLS filter.

problem Accurate real-time waypoints estimation under measurement noise in nonlinear, time-varying systems.
method Residual Variance Matching Recursive Least Squares (RVM-RLS) filter guided by RVME criterion.
result Improved waypoints estimation accuracy by approximately 88% compared to benchmarks.