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

4183124165 · Jun 202019922001200920172026
48 results for 3D reduction

We show that 3D gravity, in its pure connection formulation, admits a natural 6D interpretation. The 3D field equations for the connection are equivalent to 6D Hitchin equations for the Chern-Simons 3-form in the total space of the principal bundle over the 3-dimensional base. Turning this construction around one gets …

2016-05-24abs ↗pdf ↗

The past several years have seen both an explosion in the use of Convolutional Neural Networks (CNNs) and the design of accelerators to make CNN inference practical. In the architecture community, the lion share of effort has targeted CNN inference for image recognition. The closely related problem of video recognition…

2018-10-16abs ↗pdf ↗

For several classes of second order dispersionless PDEs, we show that the symbols of their formal linearizations define conformal structures which must be Einstein-Weyl in 3D (or self-dual in 4D) if and only if the PDE is integrable by the method of hydrodynamic reductions. This demonstrates that the integrability of t…

2012-08-13abs ↗pdf ↗

The paper classifies path structures on 3D Lie groups and reduces non-flat ones to Z/2Z-structures.

problem Classifying and reducing path structures on 3D Lie groups.
method Analyzes curvature and automorphism groups to reduce path structures to simpler forms.
result Automorphism groups of non-flat path structures are maximal dimension 3.

The paper explores the connection between 3d gravity and Chern-Simons theory using affine group connections.

problem Exploring the relationship between 3d gravity and Chern-Simons theory.
method A variational problem of Chern-Simons type on a principal fiber bundle with general affine group structure is studied. The connection is established through a generalized notion of extension and reduction of connections.
result Established a correspondence between 3d gravity and Chern-Simons theory using affine group connections.

CARV reduces compute cost for downstream pipelines using diffusion models.

problem High variance in Monte Carlo estimators from diffusion models limits compute efficiency.
method CARV uses hierarchical MC estimation with amortized upstream computation and stratified-inverse-CDF.
result CARV delivers 2-3x effective compute multipliers without changing the objective.

RCLA reduces noise in topological data analysis, preserving essential structure.

problem Noise in large datasets obscures topological features in persistent homology.
method Grid-based RCLA integrates data reduction and denoising with a threshold parameter.
result RCLA provides a theoretical guarantee and automatic parameter selection.

pyLOT library simplifies machine learning on 3D point clouds via linearized optimal transport.

problem Performing machine learning tasks on 3D point clouds.
method Linearized optimal transport (LOT) to embed distributions into Hilbert space, enabling linear machine learning.
result Downstream tasks on embedded representations are simplified to linear operations.

We consider the optimal control problem for null curves in de Sitter 3-space defined by a functional which is linear in the curvature of the trajectory. We show how techniques based on the method of moving frames and exterior differential systems, coupled with the reduction procedure for systems with a Lie group of sym…

2007-10-02abs ↗pdf ↗

Convolutional Neural Networks (CNNs) require a large amount of annotated data to learn from, which is often difficult to obtain in the medical domain. In this paper we show that the sample complexity of CNNs can be significantly improved by using 3D roto-translation group convolutions (G-Convs) instead of the more conv…

2018-04-12abs ↗pdf ↗

A novel 3D shape registration method using spectral graph embedding and probabilistic matching.

problem Challenges in 3D shape analysis and registration, especially with large variability.
method Combining spectral graph matching with Laplacian embedding for large graphs, using commute-time embedding and PCA.
result A method to register shapes with different samplings and isometric deformations.

We show that the smooth geometry of a hyperbolic 3-manifold emerges from a classical spin system defined on a 2d discrete lattice, and moreover show that the process of this "dimensional oxidation" is equivalent with the dimensional reduction of a supersymmetric gauge theory from 4d to 3d. More concretely, we propose a…

2012-03-26abs ↗pdf ↗

Topology optimization is computationally demanding that requires the assembly and solution to a finite element problem for each material distribution hypothesis. As a complementary alternative to the traditional physics-based topology optimization, we explore a data-driven approach that can quickly generate accurate so…

2018-08-22abs ↗pdf ↗

Paper proposes PCA-GMM for efficient superresolution of material images.

problem Efficiently handling large and high-dimensional data sets.
method PCA-GMM combining Gaussian Mixture Model and PCA for dimensionality reduction.
result PCA-GMM improves superresolution of material images with moderate dimensionality reduction.

We study knots in 3d Chern-Simons theory with complex gauge group SL(N,C)SL(N,\mathbb{C}), in the context of its relation with 3d N=2\mathcal{N}=2 theory (the so-called 3d-3d correspondence). The defect has either co-dimension 2 or co-dimension 4 inside the 6d (2,0)(2,0) theory, which is compactified on a 3-manifold M^\hat{M}. …

2015-10-13abs ↗pdf ↗

Data assimilation for subsurface flow using latent diffusion models shows that ensemble Kalman methods may overestimate posterior uncertainty, while Monte Carlo sampling is more reliable.

problem Data assimilation for subsurface flow
method Ensemble Kalman smoother and Markov chain Monte Carlo sampling
result Monte Carlo sampling is more reliable than ensemble Kalman methods

Study of 3d-3d correspondence involving qq-Weyl algebra and 3d-index.

problem Understanding the action of a qq-Weyl algebra on the 3d-index of knots.
method Investigation of the qq-Weyl algebra's module action on the 3d-index, conjecturing structural properties.
result Bilinear factorization, pair of linear qq-difference equations, and rational function matrix for the 3d-index determination.

Motivated by the idea of turbomachinery active subspace performance maps, this paper studies dimension reduction in turbomachinery 3D CFD simulations. First, we show that these subspaces exist across different blades---under the same parametrization---largely independent of their Mach number or Reynolds number. This is…

2019-10-20abs ↗pdf ↗

Autonomous driving requires 3D perception of vehicles and other objects in the in environment. Much of the current methods support 2D vehicle detection. This paper proposes a flexible pipeline to adopt any 2D detection network and fuse it with a 3D point cloud to generate 3D information with minimum changes of the 2D d…

2018-02-12abs ↗pdf ↗

DreamFusion uses text-to-image diffusion models to create 3D images efficiently.

problem Lack of large-scale 3D datasets and efficient architectures for 3D synthesis.
method Adapting a 2D diffusion model to 3D synthesis using a loss based on probability density distillation.
result A 3D model can be optimized from a 2D diffusion model, allowing for text-to-3D synthesis.

Motivated by recent advance of machine learning using Deep Reinforcement Learning this paper proposes a modified architecture that produces more robust agents and speeds up the training process. Our architecture is based on Asynchronous Advantage Actor-Critic (A3C) algorithm where the total input dimensionality is halv…

2018-04-13abs ↗pdf ↗

The study connects knot complements to 3d theories via half-index calculations.

problem Understanding the relationship between knot complements and 3d theories.
method Using half-index calculations and inverted Habiro series, the study realizes knot complements as homological blocks.
result The colored Jones polynomial is derived from choosing specific poles in the half-index integral expression.

GCDM generates valid large 3D molecules and optimizes existing molecules.

problem Lack of geometric properties in 3D molecule generation models.
method Introduces Geometry-Complete Diffusion Model (GCDM) using equivariant GNNs.
result Significantly outperforms existing models in 3D molecule generation and optimization.

Generates coherent 3D scenes from monocular videos without supervision.

problem Lack of 3D scene modeling in video generation models.
method Trains a model to generate 3D scenes with moving objects and a background from monocular videos.
result Trained model generates coherent 3D scenes with multiple moving objects and a background.

Study large N oscillations in 3D theories related to black hole physics.

problem Understanding large N sign oscillations in 3D theories via holography.
method Holographic computation of on-shell actions for Euclidean supergravity solutions, Wick rotation of magnetically charged AdS4 black holes.
result Proposed a non-trivial mathematical conjecture regarding phase factors of twisted Reidemeister-Ray-Singer torsion.

Enhances 2D face recognition with 3D features using active illumination.

problem Improving robustness of 2D face recognition to spoofing attacks and low-light conditions.
method Projecting a high spatial frequency pattern onto the face to recover 3D information and a 2D image simultaneously.
result Significantly boosts face recognition performance and dramatically improves robustness to spoofing attacks.

Optimizes master faces for 2D and 3D face verification using evolutionary algorithms and neural networks.

problem Impersonation attacks using master faces for face-based identity authentication.
method Evolutionary algorithm in latent space of StyleGAN, neural network to direct search, 2D and 3D face reconstruction.
result Obtains high impersonation rates with fewer master faces for 2D and 3D face verification.