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

136272407543 · Jun 202019922001200920172026
48 results for constrained space

We show that the homogeneous and the 2-lobe Delaunay tori in the 3-sphere provide the only isothermic constrained Willmore tori in 3-space with Willmore energy below 8π. In particular, every constrained Willmore torus with Willmore energy below 8π and non-rectangular conformal class is non-degenerated.

2019-03-28abs ↗pdf ↗

Develops G-MLKM for better data-target association in constrained spaces.

problem Data-target association problem in constrained spaces with limited sensor information.
method Graph-based multi-layer k-means++ (G-MLKM) method, including MLKM for local space and G-MLKM for general constrained space.
result Improves data-target association accuracy through error correction mechanisms.

Constrained Willmore surfaces are conformal immersions of Riemann surfaces that are critical points of the Willmore energy W=H2W=\int H^2 under compactly supported infinitesimal conformal variations. Examples include all constant mean curvature surfaces in space forms. In this paper we investigate more generally the crit…

2004-11-22abs ↗pdf ↗

Algorithm optimizes constrained reinforcement learning with dual variables.

problem Minimizing convex functional subject to convex constraint in large state spaces.
method VPDPO algorithm using Lagrangian and Fenchel duality.
result Achieves sublinear regret and constraint violation, globally optimal policy.

Constrained Willmore surfaces are critical points of the Willmore functional under conformal variations. As shown in [5] one can associate to any conformally immersed constrained Willmore torus f a compact Riemann surface Σ, such that f can be reconstructed in terms of algebraic data on Σ. Particularly interesting exam…

2012-12-10abs ↗pdf ↗

New algorithms for sampling in constrained domains without learning rates.

problem Sampling in constrained domains with fairness constraints and post-selection inference.
method Coin betting ideas from convex optimisation and a unifying framework for constrained sampling.
result Our algorithms achieve competitive performance without hyperparameter tuning.

Study compares constrained and decoupled moduli spaces of manifolds with particles and discs.

problem Comparing constrained and decoupled moduli spaces of manifolds with embedded particles and discs.
method Generalized Bödigheimer--Tillmann's work to higher dimensions and different tangential structures.
result New results for surfaces with different tangential structures and higher dimensional manifolds.

In reinforcement learning, an agent attempts to learn high-performing behaviors through interacting with the environment, such behaviors are often quantified in the form of a reward function. However some aspects of behavior-such as ones which are deemed unsafe and to be avoided-are best captured through constraints. W…

2020-02-16abs ↗pdf ↗

Paper revisits DP-SCO in Euclidean and pd\ell_p^d spaces, focusing on constrained and bounded sets.

problem Differentially private stochastic convex optimization in constrained and bounded sets in Euclidean and pd\ell_p^d spaces.
method Proposes methods achieving excess population risks dependent on Gaussian width of the constraint set, and novel algorithms for unconstrained and heavy-tailed data.
result Theoretical results for DP-SCO in pd\ell_p^d spaces, including optimal bounds for strongly convex functions.

New discrete curves defined in space forms with geometric properties.

problem Defining discrete elastic and constrained elastic curves in space forms.
method Extending discrete Euclidean curvature to space forms and using Bäcklund transformations.
result Discrete elastic and constrained elastic curves are elements of a curve hierarchy.

Study of star-shaped hypersurfaces with capillary boundary using constrained mean curvature flow.

problem Understanding the evolution of hypersurfaces with capillary boundaries.
method Locally constrained mean curvature flow for star-shaped hypersurfaces in the half-space.
result Established new Alexandrov-Fenchel inequalities for convex hypersurfaces with capillary boundary.

The paper proves geometric inequalities for pinched convex hypersurfaces in de Sitter space.

problem Geometric inequalities for convex hypersurfaces in de Sitter space.
method Locally constrained flows with initial compact spacelike hypersurfaces pinched in de Sitter space.
result Established geometric inequalities related to quermassintegrals and weighted curvature integrals.

In-BO optimizes complex constrained domains using SIn-GP surrogate models.

problem Optimizing in complex constrained domains with irregular shapes.
method Sparse Intrinsic Gaussian Processes (SIn-GP) on manifolds with heat kernel estimation.
result In-BO outperforms traditional BO in complex constrained domains.

We study configuration spaces of linkages whose underlying graph are polygons with diagonal constrains, or more general, partial two-trees. We show that (with an appropriate definition) the oriented area is a Bott-Morse function on the configuration space. Its critical points are described and Bott-Morse indices are co…

2017-02-24abs ↗pdf ↗

The paper solves a conjecture about spacelike hypersurfaces in de Sitter space.

problem Proving an Alexandrov-Fenchel inequality for closed 2-convex spacelike hypersurfaces in de Sitter space.
method Investigating the locally constrained inverse curvature flow to establish the inequality.
result Established an Alexandrov-Fenchel inequality for closed 2-convex spacelike hypersurfaces in de Sitter space.

A new framework uses an Incremental Transformer to design geopolymer mixtures efficiently.

problem Designing geopolymer mixtures with limited data and physical constraints.
method Topology-aware surrogate framework guided by Incremental Transformer.
result The design space is redundant, with fewer effective mixture regimes.

CEI achieves convergence rates for constrained Bayesian optimization.

problem Constrained Bayesian optimization with theoretical convergence rates.
method Analyzing simple regret upper bound for CEI in RKHS and Gaussian process settings.
result CEI achieves convergence rates of t12logd+12(t)t^{-\frac{1}{2}}\log^{\frac{d+1}{2}}(t) and tν2ν+dlogν2ν+d(t)t^{\frac{-ν}{2ν+d}} \log^{\fracν{2ν+d}}(t) for squared exponential and Matérn kernels, respectively.

Bayesian neural network (BNN) priors are defined in parameter space, making it hard to encode prior knowledge expressed in function space. We formulate a prior that incorporates functional constraints about what the output can or cannot be in regions of the input space. Output-Constrained BNNs (OC-BNN) represent an int…

2019-05-15abs ↗pdf ↗

Diffeologies unify infinite-dimensional geometry and PDEs, enhancing classical function spaces.

problem Combining infinite-dimensional geometry and PDEs for optimization problems.
method Review and extension of classical function spaces and mapping spaces.
result Diffeologies provide a unified framework for evolution equations and optimization problems.

We propose a class of intrinsic Gaussian processes (in-GPs) for interpolation, regression and classification on manifolds with a primary focus on complex constrained domains or irregular shaped spaces arising as subsets or submanifolds of R, R2, R3 and beyond. For example, in-GPs can accommodate spatial domains arising…

2018-01-03abs ↗pdf ↗

Proposes Constrained Q-learning for reinforcement learning with constraints.

problem Optimizing multiple objectives while adhering to constraints in reinforcement learning.
method Directly restricts the action space in Q-update to learn optimal Q-function for constrained MDP.
result Improves safety and optimality in high-level decision making for autonomous driving.

Automatic Chemical Design is a framework for generating novel molecules with optimized properties. The original scheme, featuring Bayesian optimization over the latent space of a variational autoencoder, suffers from the pathology that it tends to produce invalid molecular structures. First, we demonstrate empirically …

2017-09-16abs ↗pdf ↗