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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for signed distance field

InSphereNet uses infilling spheres for 3D object classification, improving accuracy with fewer parameters.

problem 3D object classification using points, voxels, or images.
method Constructs infilling spheres from signed distance field (SDF) for classification.
result InSphereNet achieves superior accuracy with fewer inputs and parameters.

A new algorithm solves signed Fréchet regression on manifolds with bounded curvature.

problem Signed Fréchet regression on Riemannian manifolds with bounded curvature.
method Proximal DC algorithm (FRIDA) for computing signed Fréchet regression fits.
result Existence and interiority of minimizers, strong convexity of proximal subproblems, and convergence to stationary points.

We extend the topological field theory (``itsy bitsy topological field theory"') of our previous work from mod-2 to twisted coefficients. This topological field theory is derived from sutured Floer homology but described purely in terms of surfaces with signed points on their boundary (occupied surfaces) and curves on …

2014-01-24abs ↗pdf ↗

Lowered regularity assumption for a phase-dependent Helfrich energy equation.

problem Analyzing the phase separation line of the Helfrich energy.
method Used a carefully chosen test function with a signed distance function.
result Regularity assumption lowered from C2C^2 to C1,1C^{1,1} for the phase separation line.

Signed seminorms linked to real tropical spaces and matroids.

problem Understanding signed seminorms and their real tropicalizations.
method Introducing signed Goldman-Iwahori space, identifying it as inverse limit of real tropicalizations, and giving matroid-theoretic description.
result Signed seminorms identified as inverse limit of real tropicalizations of projective space.

Paper extends MLFD to signed measures via bilevel approach.

problem Risk minimization for infinite width neural networks and sparse deconvolution.
method Bilevel reduction to extend MLFD to signed measures, investigating convergence rates.
result Improved convergence rates for bilevel MFLD in low-noise regime and local exponential convergence for single neuron learning.

Refines d'Alembertian for signed Lorentz distance functions in metric measure spacetimes.

problem Exact representation and bounds of d'Alembertian for signed Lorentz distance functions.
method Metric geometry techniques, localization, Sobolev calculus.
result Distributional d'Alembertian is a signed measure with integration by parts formula.

The paper bounds solutions to complex optimization problems with uncertain data.

problem Distributionally robust optimization problems with multivariate uncertainty sets.
method Conditions and bounds derived for multivariate and univariate Wasserstein distances, Bregman-Wasserstein divergences, and signed Choquet integrals.
result Computable lower and upper bounds for DRO problems, derived from scalar-valued aggregation functions and Wasserstein distances.

Let F:[0,)[0,)F: [0, \infty) \to [0, \infty) be a strictly increasing C2C^2 function with F(0)=0F(0)=0. We unify the concepts of FF-harmonic maps, minimal hypersurfaces, maximal spacelike hypersurfaces, and Yang-Mills Fields, and introduce FF-Yang-Mills fields, FF-degree, FF-lower degree, and generalized Yang-Mills-Born-Infeld…

2010-03-19abs ↗pdf ↗

Differentiable pipeline replaces non-differentiable CAE components for shape optimization.

problem Gradient-based optimization is limited by non-differentiable components in CAE workflows.
method Surrogate models replace non-differentiable pipeline components, enabling gradient-based optimization.
result Gradient-based shape optimization possible without differentiable solvers.

The paper proves the existence of infinite sign-changing solutions to a Hardy-Sobolev equation on Riemannian manifolds.

problem Existence of solutions to a specific type of Hardy-Sobolev equation on Riemannian manifolds.
method Addressed using the properties of isoparametric functions and focusing on the distance function from a submanifold.
result Proves the existence of infinite sign-changing solutions to the Hardy-Sobolev equation.

DKMD is a fast signed statistic for comparing univariate distributions.

problem Comparing univariate distributions, especially preserving directionality.
method DKMD integrates kernel mean embeddings against an odd weighting function.
result DKMD preserves directionality and is robust to outliers.

Learning a distance function or metric on a given data manifold is of great importance in machine learning and pattern recognition. Many of the previous works first embed the manifold to Euclidean space and then learn the distance function. However, such a scheme might not faithfully preserve the distance function if t…

2014-05-01abs ↗pdf ↗

In this paper, we propose a game theoretical adversarial intervention detection mechanism for reliable smart road signs. A future trend in intelligent transportation systems is ``smart road signs" that incorporate smart codes (e.g., visible at infrared) on their surface to provide more detailed information to smart veh…

2019-01-30abs ↗pdf ↗

The Pearson distance between a pair of random variables X,YX,Y with correlation ρxyρ_{xy}, namely, 1-ρxyρ_{xy}, has gained widespread use, particularly for clustering, in areas such as gene expression analysis, brain imaging and cyber security. In all these applications it is implicitly assumed/required that the distance …

2019-08-15abs ↗pdf ↗

Semantic Embeddings are a popular way to represent knowledge in the field of zero-shot learning. We observe their interpretability and discuss their potential utility in a safety-critical context. Concretely, we propose to use them to add introspection and error detection capabilities to neural network classifiers. Fir…

2019-05-19abs ↗pdf ↗

New neural architectures invariant to sign flips and basis symmetries for graph representation learning.

problem Learning invariant graph representations from eigenvectors.
method SignNet and BasisNet neural architectures that are invariant to sign flips and basis symmetries.
result Proven to be universal, approximating any continuous function of eigenvectors with desired invariances.

For a domain ΩRnΩ\subset\mathbb R^n, we introduce the concept of a uniformly CmC^m defining function. We characterize uniformly CmC^m defining functions in terms of the signed distance function for the boundary and provide a large class of examples of unbounded domains with uniformly CmC^m defining functions. Some of ou…

2011-11-17abs ↗pdf ↗

We show that for a simple surface with boundary the attenuated ray transform in the presence of a unitary connection and a skew-Hermitian Higgs field is injective modulo the natural obstruction for functions and vector fields. We also show that the connection and the Higgs field are uniquely determined by the scatterin…

2011-08-04abs ↗pdf ↗

The paper examines convergence of distances in Lipschitz structures on manifolds.

problem Convergence of distances in Lipschitz vector fields and norms on manifolds.
method Analysis of convergence of distances associated to converging structures of Lipschitz vector fields and norms.
result Under mild controllability assumption, distances converge locally uniformly to the limit Carnot-Carathéodory distance.

Paper introduces length measures for curves and convex shapes, proving isoperimetric and distance properties.

problem Characterizing and comparing convex shapes using length measures.
method Developed length measures for curves and convex shapes, derived properties, and introduced a new distance metric.
result Unique convex curve maximizes signed area among curves with same length measure.

Study on function sensitivity in random DNNs using large deviation theory.

problem Understanding function sensitivity in finite-size deep neural networks.
method Large deviation theory and path integral analysis applied to random DNNs with ReLU and sign activations.
result Random DNNs with ReLU activations are more robust to parameter perturbations.

Paper connects surface shape analysis and unbalanced optimal transport.

problem Computing the SRNF shape distance on piecewise linear surfaces.
method Characterizes SRNF shape distance as WFR distance pullback, proposes new algorithm for WFR distance computation.
result Direct computation of SRNF shape distance on piecewise linear surfaces.

For any compact oriented manifold MM, we show that that the top degree multi-vector fields transverse to the zero section of topTM\wedge^{\text{top}}TM are classified, up to orientation preserving diffeomorphism, in terms of the topology of the arrangement of its zero locus and a finite number of numerical invariants. Th…

2002-09-26abs ↗pdf ↗

Study projective symmetries in Finsler spaces, showing reductions and constant flag curvature.

problem Exploring projective symmetries in Finsler spaces and their properties.
method Analyzing algebraic sub-algebras and curvature invariants of projective vector fields.
result Closed Finsler spaces with negative Ricci curvature reduce to Killing vector fields.

The paper explores generalized quasi-Einstein manifolds and their properties.

problem Investigating properties of generalized quasi-Einstein manifolds under specific conditions.
method Analyzing natural conditions on potential vector fields and deriving consequences.
result The potential vector field is shown to be Killing under suitable integral assumptions.

Hypothesis tests are a crucial statistical tool for data mining and are the workhorse of scientific research in many fields. Here we present a differentially private analogue of the classic Wilcoxon signed-rank hypothesis test, which is used when comparing sets of paired (e.g., before-and-after) data values. We present…

2018-09-05abs ↗pdf ↗

Spider GAN accelerates GAN training with a new approach.

problem Stable training of Generative adversarial networks (GANs).
method Spider GAN leverages a novel approach to identify closely related datasets (friendly neighborhoods) and uses a new measure (signed inception distance) to accelerate GAN training.
result Spider GAN achieves faster convergence and state-of-the-art FID values with one-fifth of the training iterations.

New theory connects string theory to swampland distance conjecture.

problem Connecting string theory to swampland distance conjecture.
method Deformations of the heterotic superpotential, treating separately for large fluxes or large distances, integrating out fields to obtain a new field theory.
result New holomorphic theory defined, connects to swampland distance conjecture.

The liquid shape between two vertical parallel plates in a gravity field due to capillary forces is studied. When the physical system achieves its mechanical equilibrium, the capillary surface has mean curvature proportional to its height above a horizontal reference plane and it meets the vertical walls in a prescribe…

2006-07-20abs ↗pdf ↗

We consider the signed density of the extremal points of (two-dimensional) scalar fields with a Gaussian distribution. We assign a positive unit charge to the maxima and minima of the function and a negative one to its saddles. At first, we compute the average density for a field in half-space with Dirichlet boundary c…

2003-01-29abs ↗pdf ↗

We present a string inspired 3D Euclidean field theory as the starting point for a modified Ricci flow analysis of the Thurston conjecture. In addition to the metric, the theory contains a dilaton, an antisymmetric tensor field and a Maxwell-Chern Simons field. For constant dilaton, the theory appears to obey a Birkhof…

2003-06-27abs ↗pdf ↗

A new metric learning framework for signed graphs using Gershgorin disc alignment.

problem Learning Mahalanobis metrics from signed graphs efficiently.
method Proposes a fast metric learning framework using Gershgorin disc perfect alignment (GDPA) to circumvent full eigen-decomposition.
result Proves that Gershgorin disc left-ends of similarity transform are perfectly aligned at the smallest eigenvalue, enabling efficient optimization.

We use a Riemannnian approximation scheme to define a notion of sub-Riemannian Gaussian curvature\textit{sub-Riemannian Gaussian curvature} for a Euclidean C2C^{2}-smooth surface in the Heisenberg group H\mathbb{H} away from characteristic points, and a notion of sub-Riemannian signed geodesic curvature\textit{sub-Riemannian signed geodesic curvature} for Euclidean C2C^{2}-smooth curve…

2016-04-01abs ↗pdf ↗

Revisits shallow neural networks using Lipschitz norms and measures.

problem Existence and compactness of minimizers in neural network formulations.
method Mean field parametrization, signed measures, duality pairings, Kantorovich-Rubinstein norms.
result Compactness results and uniform large data limits for empirical risk minimization.