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

Trend · papers per month

25507499 · Jun 202019922001200920172026
48 results for analytic obstacles

New boundary condition for weak inverse mean curvature flow in bounded domains.

problem Addressing the well-posedness of inverse mean curvature flow in bounded domains with an outer obstacle.
method Developed a new boundary condition, combined techniques including elliptic regularization, blow-up analysis, and parabolic estimates.
result Existence and uniqueness theorem for weak solutions in smooth bounded domains, with C1,αC^{1,α} regularity of level sets up to the obstacle.

Paper tackles utility maximization with job-switching and retirement constraints.

problem Maximizing utility with job-switching and retirement constraints.
method Dual-martingale approach and double obstacle problem theory.
result Characterization of optimal job-switching strategy and wealth boundaries.

Study finds a limiting distribution for free path lengths on flat surfaces with circular obstacles.

problem Understanding free path lengths on flat surfaces with circular obstacles.
method Proved the existence of a limiting distribution using radius of obstacles as a parameter.
result Relates the limiting distribution to heights of zippered rectangle decompositions.

Study on elastic curves pinned at the boundary, focusing on minimizers and their interaction with obstacles.

problem Minimizing elastic bending energy for open planar curves with obstacles.
method Investigation of global minimizers and explicit solutions for different values of the penalization parameter.
result Explicit threshold for λλ above which minimizers touch the obstacle, regardless of obstacle shape.

The paper deals with some problems related to recovering information about an obstacle in an Euclidean space from certain measurements of lengths of generalized geodesics in the exterior of the obstacle. The main result is that if two obstacles satisfy some generic regularity conditions and have (almost) the same trave…

2014-04-16abs ↗pdf ↗

New approach for obstacle avoidance in robotics using learned representations.

problem Challenges in sensor-based motion planning for new and dynamic environments.
method Proposes a new obstacle representation using PointNet architecture trained jointly with policies for obstacle avoidance.
result Significant improvements in accuracy and efficiency compared to state of the art.

The paper finds local minimizers for obstacle avoidance on curved spaces.

problem Finding optimal paths on curved spaces avoiding obstacles.
method Minimizing an action functional with bi-Jacobi fields and biconjugate points.
result Local minimizers are classified into two categories with local uniqueness results.

The paper simplifies conditions for optimal paths on manifolds avoiding obstacles.

problem Finding optimal paths on manifolds avoiding obstacles.
method Study of sufficient conditions for optimality on Riemannian manifolds and Lie groups.
result New conditions for optimality are provided in terms of matrix invertibility.

Study anisotropic obstacle problem for minimal surfaces using Cahn-Hoffman transform.

problem Anisotropic obstacle problem for minimal surfaces.
method Cahn-Hoffman transform to convert to isotropic problem with generalized Robin boundary condition.
result Optimal regularity of the solution and C1,1C^{1,1} regularity of the free boundary.

We consider the broken ray transform on Riemann surfaces in the presence of an obstacle, following earlier work of Mukhometov. If the surface has nonpositive curvature and the obstacle is strictly convex, we show that a function is determined by its integrals over broken geodesic rays that reflect on the boundary of th…

2014-03-20abs ↗pdf ↗

Anisotropic obstacle problems and Stefan problem studied with evolving surfaces.

problem Anisotropic parabolic obstacle problems and Stefan problem.
method Cahn-Hoffman transform and anisotropic mean curvature flow.
result Optimal regularity of the solution and C1,αC^{1,α}-regularity of the evolving free boundary.

We consider an obstacle problem for elastic curves with fixed ends. We attempt to extend the graph approach provided in [8]. More precisely, we investigate nonexistence of graph solutions for special obstacles and extend the class of admissible curves in a way that an existence result can be obtained by a penalization …

2018-12-07abs ↗pdf ↗

Analyzes symmetries in neural networks to predict learning dynamics.

problem Understanding the dynamics of neural network parameters during training.
method Unified theoretical framework based on symmetries and conservation laws.
result Symmetries impose geometric constraints on gradients and Hessians, leading to conservation laws.

In this paper, we analyze a real-valued reflected backward stochastic differential equation (RBSDE) with an unbounded obstacle and an unbounded terminal condition when its generator ff has quadratic growth in the zz-variable. In particular, we obtain existence, comparison, and stability results, and consider the opti…

2010-05-19abs ↗pdf ↗

This paper presents preliminary work on learning the search heuristic for the optimal motion planning for automated driving in urban traffic. Previous work considered search-based optimal motion planning framework (SBOMP) that utilized numerical or model-based heuristics that did not consider dynamic obstacles. Optimal…

2018-05-25abs ↗pdf ↗

Motivated by analogies with basic density theorems in analytic number theory, we introduce a notion (and variations) of the homological density of one space in another. We use Weil's number field/ function field analogy to predict coincidences for limiting homological densities of various sequences $\mathcal{Z}^{(d_1,\…

2016-11-14abs ↗pdf ↗

New DAG constraints improve differentiable DAG learning.

problem Recovering DAG structures from observational data is hard due to combinatorial optimization.
method Developed analytic functions to formulate DAG constraints, closed under differentiation, summation, and multiplication.
result Analytic DAG constraints outperform previous methods in various settings.

Billiard trajectories (broken generalised geodesics) are considered in the exterior of an obstacle KK with smooth boundary on an arbitrary Riemannian manifold. We prove a generalisation of the well-known Santalo's formula. As a consequence, it is established that if the set of trapped points has positive measure, then…

2016-01-15abs ↗pdf ↗

A framework for navigating environments with spatially correlated obstacles and uncertain blockage status.

problem Navigation in environments with spatially correlated obstacles of uncertain blockage status.
method Modeling spatial correlation with Gaussian Random Field, developing Bayesian belief updates, proposing a two-stage learning framework with offline and online phases.
result Consistent performance gains over baselines in environments with adversarial interruptions or clustered natural hazards.

GP-ND avoids obstacles in trajectory planning using Gaussian Process regression.

problem Avoiding obstacles in trajectory planning for real-world systems.
method GP-ND models negative data pairs using Gaussian distributions and maximizes their KL divergence from the GP to avoid them.
result GP-ND outperforms traditional GP learning in obstacle-aware trajectory planning.

The Heston stochastic volatility process is a degenerate diffusion process where the degeneracy in the diffusion coefficient is proportional to the square root of the distance to the boundary of the half-plane. The generator of this process with killing, called the elliptic Heston operator, is a second-order, degenerat…

2012-06-05abs ↗pdf ↗

We prove that if two non-trapping obstacles in Rn\mathbb{R}^n satisfy some rather weak non-degeneracy conditions and the scattering rays in their exteriors have (almost) the same travelling times or (almost) the same scattering length spectrum, then they coincide.

2017-09-06abs ↗pdf ↗

Study on semiconcavity of solutions to gradient obstacle problems on compact manifolds.

problem Gradient obstacle problems on compact Riemannian manifolds.
method Uniform semiconcavity estimates and fine convergence results for solutions and free boundaries.
result The elastic and λλ-elastic sets of solutions converge to the cut locus and λλ-cut locus of the manifold.

Coordinated defensive escorts can aid a navigating payload by positioning themselves in order to maintain the safety of the payload from obstacles. In this paper, we present a novel, end-to-end solution for coordinating an escort team for protecting high-value payloads. Our solution employs deep reinforcement learning …

2019-10-09abs ↗pdf ↗

Rigidity of travel times for convex obstacles in Riemannian manifolds is proven.

problem Rigidity of travel times for strictly convex obstacles in Riemannian manifolds.
method Analysis of billiard trajectories and comparison of travel times.
result If travel times are equal, then obstacles are identical in dimensions greater than or equal to 3.

By introducing a shape manifold as a solution set to solve inverse obstacle scattering problems we allow the reconstruction of general, not necessarily star-shaped curves. The bending energy is used as a stabilizing term in Tikhonov regularization to gain independence of the parametrization. Moreover, we discuss how se…

2019-03-12abs ↗pdf ↗

The paper studies the properties of maps with free boundaries, focusing on the obstacle case.

problem Properties of the projected image and its regularity in maps with free boundaries.
method Dividing the map into distance and projected image parts; applying classical obstacle problem methods and proving higher regularity for the projected image.
result The projected image is at most of class C2,1C^{2,1} and globally of class W3,BMOW^{3,BMO}, locally of C2,1C^{2,1} around the regular part of the free boundary.

Optimal controls for conformal Laplacian obstacle problems on spheres and manifolds.

problem Optimal control of conformal metrics with constant scalar curvature.
method Analysis of optimal control problem on Riemannian manifolds with positive Yamabe invariant.
result Existence of smooth optimal controls inducing metrics with constant scalar curvature.

Improved covariance matrix estimation for portfolio optimization with guaranteed PSD and controlled conditioning.

problem Guaranteeing positive semidefinite ness and controlling spectral conditioning in IQ estimators.
method Introducing squeezing identity and atomic-IQ parameterization to construct structured channel matrices with PSD guarantees and analytic eigen floor for conditioning control.
result Atomic-IQ improves Sharpe ratios and delivers a more stable risk profile compared to standard estimators.

We study periodic wind-tree models, billiards in the plane endowed with Z2\mathbb{Z}^2-periodically located identical connected symmetric right-angled obstacles. We show asymptotic formulas for the number of (isotopy classes of) closed billiard trajectories (up to Z2\mathbb{Z}^2-translations) on the wind-tree billiard.…

2016-04-19abs ↗pdf ↗

Deep network learns Obstacle Tower challenge without human demonstrations.

problem Master procedurally generated levels that get progressively harder.
method Deep Reinforcement Learning with a simple feed-forward network.
result Performed competitively in a reinforcement learning competition.