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

Trend · papers per month

3727441,1151,487 · Jun 202019922001200920182026
48 results for new problems

We define a new formal Riemannian metric on a conformal class in the context of the vn2v_{\frac{n}{2}}-Yamabe problem. Our construction leads to a new variational characterization and a new parabolic flow approach to this problem. Moreover, this variational framework suggests that solutions to this problem are unique in…

2016-11-01abs ↗pdf ↗

We present a new class of solutions for the inverse problem in the calculus of variations in arbitrary dimension nn. This is the problem of determining the existence and uniqueness of Lagrangians for systems of nn second order ordinary differential equations. We also provide a number of new theorems concerning the in…

2014-12-04abs ↗pdf ↗

New existence results for curvature problem on balls with specific conditions.

problem Existence of solutions for a prescribed mean curvature problem on a ball.
method Combining critical points at infinity approach with Morse theory.
result New existence results for higher dimensional case n5n\geq 5 under pinching conditions.

New control theory for self-path-dependent problems solves unique constraints.

problem Optimal control with self-path-dependent constraints in stochastic systems.
method Introduces new HJB equations for variational inequalities with historical maximum controls.
result Value functions are viscosity solutions to HJB equations under Lipschitz conditions.

Study anisotropic flows solving Orlicz-Minkowski problems, proving existence and new results.

problem Anisotropic non-homogeneous Gauss curvature flows and Orlicz-Minkowski problems.
method Long-time existence and behavior analysis, parabolic approximation method, curvature flow.
result Existence and new results for Orlicz-Minkowski problems, including LpL_p versions.

We propose a novel reformulation of the stochastic optimal control problem as an approximate inference problem, demonstrating, that such a interpretation leads to new practical methods for the original problem. In particular we characterise a novel class of iterative solutions to the stochastic optimal control problem …

2010-09-20abs ↗pdf ↗

New algorithms solve complex function optimization problems.

problem Optimizing unknown functions in competitive learning models.
method Proposed F-LCB algorithm based on UCB-type methods for nonlinear optimization.
result Regret upper bounds for the F-LCB algorithm derived from base algorithms' convergence rates.

A new presentation of the nn-string braid group BnB_n is studied. Using it, a new solution to the word problem in BnB_n is obtained which retains most of the desirable features of the Garside-Thurston solution, and at the same time makes possible certain computational improvements. We also give a related solution to t…

1997-12-02abs ↗pdf ↗

ICON learns differential equation operators from prompts, reducing retraining and improving few-shot learning.

problem Training neural networks to solve differential equations without retraining for new problems.
method In-Context Operator Networks (ICON) that learns operators from prompted data and applies them to new problems.
result ICON can generalize to new operators beyond the training distribution and requires only a few demos.

New geometric system from Hessian operators offers solutions to geometric problems.

problem Solving geometric problems using Hessian operators.
method Introducing a new differential-geometric system based on mm-Hessian operators.
result Deduced an a priori C1C^1-estimate for solutions to the Dirichlet problem for mm-Hessian equations.

New BE dimension measure reveals rich RL problems with sample-efficient algorithms.

problem Finding sample-efficient algorithms for complex RL problems.
method Introducing Bellman Eluder (BE) dimension and designing GOLF and OLIVE algorithms.
result GOLF and OLIVE algorithms learn near-optimal policies for low BE dimension problems with polynomial samples.

The techniques and analysis presented in this thesis provide new methods to solve optimization problems posed on Riemannian manifolds. These methods are applied to the subspace tracking problem found in adaptive signal processing and adaptive control. A new point of view is offered for the constrained optimization prob…

2013-05-08abs ↗pdf ↗

New biharmonic Steklov problem on forms yields eigenvalue estimates.

problem Eigenvalue estimates for differential forms with curvature quantities.
method Introduced a new biharmonic Steklov problem and proved existence of a discrete spectrum.
result Established Kuttler-Sigillito inequalities connecting eigenvalues of differential forms.

A new method for optimizing black-box problems with constraints.

problem Optimizing black-box systems with multiple performance criteria and constraints.
method Developed a novel constrained Bayesian optimization approach based on the knowledge gradient method.
result A new acquisition function that balances optimality and feasibility.

A new algorithm screens negligible components to efficiently approximate optimal transport distances.

problem Efficiently approximating the Sinkhorn distance between discrete measures.
method Screening of negligible components in the dual solution of the regularized Sinkhorn problem.
result Screenkhorn algorithm provides provable guarantees with smaller computational complexity.

Paper classifies critical points in half-space with new distance function.

problem Classifying critical points in half-space with capillary CMC hypersurfaces.
method New shifted distance function for capillary problem in half-space.
result Proves Alexandrov-type theorem for singular capillary CMC hypersurfaces.

New approach removes obstructions in gluing spacelike and null hypersurfaces in Einstein equations.

problem Gluing two solutions of the Einstein equations along a hypersurface.
method Active utilization of nonlinearity, low-frequency linear analysis, high-frequency nonlinear control.
result Removes 10-dimensional obstructions in null and spacelike gluing problems.

New framework uses score-based priors to solve ill-conditioned polynomial equations, improving signal recovery from noisy data.

problem Recovering signals from low-order moments in inverse problems, especially ill-conditioned polynomial equations.
method Integrates score-based diffusion priors with moment-based estimators to regularize and solve nonlinear inverse problems.
result Diffusion priors improve recovery from third-order moments and make super-resolution MTD feasible.