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

77154231308 · Jun 202019922001200920172026
48 results for 3D Lipschitz domains

Novel boundary integral equations for Dirac operators in 3D Lipschitz domains.

problem Developing equations for Dirac operators in complex 3D domains.
method First-kind boundary integral equations, generalized Garding inequalities, Fredholm operators, finite dimensional kernels, Betti numbers.
result Finite dimensional kernels equal to the sum of Betti numbers, explaining the bilinear forms.

We define self-adjoint extensions of the Hodge Laplacian on Lipschitz domains in Riemannian manifolds, corresponding to either the absolute or the relative boundary condition, and examine regularity properties of these operators' domains and form domains. We obtain results valid for general Lipschitz domains, and stron…

2004-08-31abs ↗pdf ↗

In \cite{kamz} the author proved that every quasiconformal harmonic mapping between two Jordan domains with C1,αC^{1,α}, 0<α10<α\le 1, boundary is bi-Lipschitz, providing that the domain is convex. In this paper we avoid the restriction of convexity. More precisely we prove: any quasiconformal harmonic mapping between two …

2009-01-25abs ↗pdf ↗

New algorithms for online learning without boundedness or Lipschitz loss assumptions.

problem Online learning with unbounded domains and non-Lipschitz losses.
method Developed an algorithm with a specific regret bound and used it for saddle-point optimization.
result First algorithm achieving non-trivial dynamic regret in an unbounded domain for non-Lipschitz losses.

For a bounded domain equipped with a piecewise Lipschitz continuous Riemannian metric g, we consider harmonic map from (Ω,g)(Ω, g) to a compact Riemannian manifold (N,h)Rk(N,h)\subset\mathbb R^k without boundary. We generalize the notion of stationary harmonic map and prove the partial regularity. We also discuss the global Li…

2011-08-22abs ↗pdf ↗

A scalable deep learning framework accelerates training of large neural networks for solving 3D Poisson equations.

problem Training large-scale neural networks for solving complex PDEs efficiently.
method Combines multigrid techniques with distributed deep learning to accelerate training.
result Solves 3D Poisson equations up to 512x512x512 resolution efficiently.

Schwarzschild 3-manifold stability proven for 3D Penrose inequality.

problem Stability of the Schwarzschild 3-manifold in the context of the 3D Riemannian Penrose inequality.
method Pointed measured Gromov-Hausdorff topology, negligible domains and boundary area perturbations.
result Schwarzschild 3-manifold stability proven for 3D Penrose inequality.

JacNet learns Jacobians to enforce structure on derivatives for invertibility and Lipschitz functions.

problem Enforcing structure on derivatives of neural network mappings.
method Proposes using a neural network to directly learn the Jacobian of the input-output function, allowing control over derivative structure.
result Demonstrates learning invertible approximations to simple and 1-Lipschitz functions.

Given a Hopf fibration of a round sphere by parallel great subspheres, we prove that the projection map to the base space is, up to isometries of domain and range, the unique Lipschitz constant minimizer in its homotopy class. Similarly, given a Hopf fibration of a round sphere by parallel great circles, we view a unit…

2010-09-28abs ↗pdf ↗

The 3D index of Dimofte-Gaiotto-Gukov a partially defined function on the set of ideal triangulations of 3-manifolds with rr torii boundary components. For a fixed 2r2r tuple of integers, the index takes values in the set of qq-series with integer coefficients. Our goal is to give an axiomatic definition of the tetra…

2012-08-08abs ↗pdf ↗

Paper investigates Lipschitz constants of self-attention modules in neural networks.

problem Lipschitz constants of self-attention modules in neural networks.
method Proved standard dot-product self-attention is not Lipschitz for unbounded input domain. Proposed L2 self-attention that is Lipschitz. Derived upper bound on L2 self-attention's Lipschitz constant.
result Proved standard self-attention is not Lipschitz for unbounded input domain and proposed an alternative L2 self-attention that is Lipschitz.

Analytic functions on specific domains are characterized by their smoothness and composites with polynomial curves.

problem Characterizing real analytic functions on closed subanalytic domains.
method Analyzing functions defined on closed uniformly polynomially cuspidal sets in Rn\mathbb{R}^n using composites with polynomial curves.
result Conditions for a function to be real analytic are effectively related to the regularity of the boundary of the domain.

LOT improves adversarial robustness by training 1-Lipschitz convolution layers.

problem Improving adversarial robustness of deep neural networks.
method LOT: Layer-wise Orthogonal Training for 1-Lipschitz convolution layers.
result LOT significantly enhances certified robustness of Lipschitz-bounded models.

Stochastic Lipschitz bandit algorithms balance exploration and exploitation, and have been used for a variety of important task domains. In this paper, we present a framework for Lipschitz bandit methods that adaptively learns partitions of context- and arm-space. Due to this flexibility, the algorithm is able to effic…

2019-01-26abs ↗pdf ↗

Generative neural network designs novel 3D molecules with specified properties.

problem Designing molecules with desired properties in chemistry.
method Conditional generative neural network for 3D molecular structures.
result Demonstrated utility in generating novel molecules with specified motifs or composition.

Deep 3D models are vulnerable to isometry transformations under adversarial attacks.

problem Vulnerability of deep 3D models to isometry transformations under adversarial attacks.
method Developed a black-box attack with success rate over 95% and a novel white-box attack framework.
result Deep 3D models are extremely vulnerable to isometry transformations under adversarial attacks.

Study Lipschitz regularity for manifold-constrained ROF model on curved surfaces.

problem Lipschitz regularity for manifold-constrained ROF model on curved surfaces.
method Generalization of ROF model, existence and uniqueness of minimizers, regularity results on PDE system.
result Lipschitz regularity of minimizers without convexity requirements.

Study shows shallow ReLU networks struggle with high-dimensional Lipschitz functions.

problem Expressing high-dimensional Lipschitz functions with shallow ReLU networks.
method Established lower bounds on shallow network complexity for polynomial approximation.
result Shallow ReLU networks suffer from the curse of dimensionality for Lipschitz functions.

Unified model learns concepts across domains like left and right.

problem Limited generalization of language concepts in inference-only models.
method Logic-Enhanced Foundation Model (LEFT) with a differentiable, domain-independent program executor.
result LEFT flexibly learns and reasons with concepts across 2D images, 3D scenes, human motions, and robotic manipulation.

This paper studies the interplay between the N=2 gauge theories in three and four dimensions that have a geometric description in terms of twisted compactification of the six-dimensional (2,0) SCFT. Our main goal is to construct the three-dimensional domain walls associated to any three-dimensional cobordism. We find t…

2013-04-24abs ↗pdf ↗

By studying the group of rigid motions, PSH(1)PSH(1), in the 3D-Heisenberg group H1H_1, we define the density and the measure for the sets of horizontal lines. We show that the volume of a convex domain DH1D\subset H_1 is equal to the integral of length of chord over all horizontal lines intersecting DD. As the classical r…

2016-09-10abs ↗pdf ↗

Proves uniqueness of capillary disks in 3D domains.

problem Proving uniqueness of capillary disks in three-dimensional domains modeled by elliptic PDEs.
method Using elliptic PDEs and properties of surfaces in 3D domains, generalizing Nitsche's and Hopf's theorems.
result Generalizes Nitsche's result for capillary constant mean curvature disks in the Euclidean ball.

We solve 6-DoF localisation and 3D reconstruction using deep state-space models.

problem 6-DoF localisation and dense 3D reconstruction in spatial environments.
method Approximate Bayesian inference in a deep state-space model combining learning and domain knowledge.
result Near state-of-the-art performance on UAV flight data.

ED-NeRF efficiently edits 3D scenes using latent space NeRF and improved loss functions.

problem Slow training speeds and inadequate editing loss functions in existing NeRF editing techniques.
method Embedding real-world scenes into latent space of LDM, using a unique refinement layer and an improved loss function.
result ED-NeRF achieves faster editing speed and improved output quality compared to state-of-the-art models.

Study compares hyperbolic and quasihyperbolic metrics in plane domains.

problem Comparing hyperbolic and quasihyperbolic metrics in plane domains.
method Analyzes metric spaces and boundaries of hyperbolic domains, proving equivalence and constructing counterexamples.
result Hyperbolic and quasihyperbolic metric spaces are quasiisometrically equivalent for finitely connected hyperbolic domains, but not in general.

Study shows bound on Uryson width for specific 3D manifolds.

problem Bounding Uryson width for 3D manifolds with non-negative Ricci curvature and strictly mean convex boundary.
method Proved existence of a Morse function with uniform diameter bounds on level sets.
result Upper bound on Uryson width for the specified 3D manifolds.

In this paper we study supersymmetric co-dimension 2 and 4 defects in the compactification of the 6d (2,0)(2,0) theory of type AN1A_{N-1} on a 3-manifold MM. The so-called 3d-3d correspondence is a relation between complexified Chern-Simons theory (with gauge group SL(N,C)SL(N, \mathbb{C})) on MM and a 3d N=2\mathcal{N}=2 theo…

2015-10-16abs ↗pdf ↗

This research explores principles of Lipschitz continuity in neural networks for robustness and generalization.

problem Ensuring robustness and generalization in neural networks, especially to small input perturbations and out-of-distribution data.
method Two complementary perspectives: internal (training dynamics) and external (frequency signal propagation).
result Advances in understanding the principles of Lipschitz continuity in neural networks.