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.

169,341 papers · 148 categories

Trend · papers per month

21416282 · May 202619922001200920182026
48 results for 2d $\mathcal{N}=(0

New neural model processes 2D data with long-range dependencies efficiently.

problem Limited receptive field of convolutions for complex 2D tasks.
method Proposes Matrix Shuffle-Exchange network with O(logn)\mathcal{O}( \log{n}) layers and O(n2logn)\mathcal{O}( n^2 \log{n}) complexity.
result Exceeds convolutional and graph neural network baselines in long-range dependency modeling.

New 4-manifold invariants derived from vertex algebras.

problem Computing 4-manifold invariants, including new and old ones.
method Using chiral correlation functions in half-twisted 2d N=(0,2)\mathcal{N}=(0,2) theories from compactified fivebranes.
result Prediction of structural properties of multi-monopole invariants and non-abelian generalizations.

New model preserves symmetry in multivariate time series, improving performance.

problem Implicit ordering in MTS models violates inherent exchangeability.
method Permutation-equivariant 2D state space model with canonical architecture.
result Eliminates sequential dependency chains and simplifies stability analysis.

Develops unisolvent weights for Nédélec second family finite elements in 2D.

problem Finding efficient degrees of freedom for Nédélec second family finite elements.
method Uses techniques of homological algebra to obtain degrees of freedom for differential forms.
result Provides a family of unisolvent and minimal physical degrees of freedom for Nédélec second family finite elements.

Abstract M5 branes on ADE singularities yields BPS spectrum and partition functions.

problem Determine the BPS spectrum and partition functions for M5 branes on ADE singularities.
method Analyze 6d N=(1,0)\mathcal{N}=(1,0) SCFTs on geometric backgrounds, using contributions from BPS strings and particles.
result Explicit expressions for BPS string and particle contributions to partition functions.

This paper improves 3D pose recovery from 2D images using non-convex regularization.

problem 3D object pose recovery from 2D images.
method Proposes non-convex regularization with leaky capped ℓ1-norm (LCNR) and multi-stage optimization.
result Theoretical analysis shows estimation error decreases with optimization stages.

Study Berry connections for 2d GLSMs, linking to cohomology theories.

problem Quantise ground states of 2d (2,2)(2,2) GLSMs on a circle.
method Relate periodic monopole solutions to difference modules and vector bundles with filtrations.
result Derive novel difference equations for brane amplitudes and vortex partition functions.

This paper analyzes shallow ReLU networks in L^p and Sobolev spaces, focusing on approximation and generalization.

problem Approximation and generalization of shallow ReLU networks in L^p and Sobolev spaces.
method Spherical harmonic analysis and embeddings into spectral Barron spaces for L^p spaces, path-norm control for Sobolev spaces.
result Minimax-optimal rates for nonparametric regression with shallow ReLU networks under path-norm control.

Theoretical analysis of CNNs' inductive biases and their efficiency in approximating functions.

problem Understanding and optimizing the inductive biases in deep CNNs.
method Theoretical analysis combining multichanneling, downsampling, weight sharing, and locality.
result Deep CNNs with O(logd)\mathcal{O}(\log d) depth can approximate any continuous function, and require O~(log2d)\widetilde{\mathcal{O}}(\log^2d) samples for sparse functions.

We propose a new description of 3d N=2\mathcal{N}=2 theories which do not admit conventional Lagrangians. Given a quiver QQ and a mutation sequence mm on it, we define a 3d N=2\mathcal{N}=2 theory T[(Q,m)]\mathcal{T}[(Q,m)] in such a way that the Sb3S^3_b partition function of the theory coincides with the cluster partition f…

2013-01-24abs ↗pdf ↗

Compactifies strata of d-differentials in genus 0.

problem Compactify strata of d-differentials in genus 0.
method Specify an ideal sheaf and show isomorphism to blow-up of M0,n\overline{\mathcal{M}}_{0,n}.
result Incidence variety compactification is isomorphic to the blow-up of M0,n\overline{\mathcal{M}}_{0,n}.

We give, using an explicit expression obtained in [V. Jones, Ann. of Math. 126, 335 (1987)], a basic hypergeometric representation of the HOMFLY polynomial of (n,m)(n,m) torus knots, and present a number of equivalent expressions, all related by Heine's transformations. Using this result the (m,n)(n,m)(m,n)\leftrightarrow (n,m) s…

2014-01-31abs ↗pdf ↗

Study of surface defects in gauge theories leads to duality and separation of variables.

problem Understanding surface observables and their transitions in gauge theories.
method Utilized Fourier transformations and spectral problems to derive dualities and separation of variables.
result Exact duality between spectral problems of spin chains and Gaudin models.

Study of 2d gauged linear sigma models to derive difference equations and spectral data.

problem Understanding monopole solutions and their spectral data in 2d gauged models.
method Analyzing ground states and cohomology of supercharges to derive difference modules and equations.
result Derived novel difference equations for brane amplitudes and hemisphere partition functions.

Extends Double Field Theory with new kinematical structure.

problem Formalizing Double Field Theory on para-Hermitian manifolds.
method Constructing a canonical connection and generalised Lie derivative for a Leibniz algebroid.
result Integrability conditions for symmetry algebra closure under non-flat and non-constant ηη and ωω.

Statistical and machine-learning algorithms are frequently applied to high-dimensional data. In many of these applications data is scarce, and often much more costly than computation time. We provide the first sample-efficient polynomial-time estimator for high-dimensional spherical Gaussian mixtures. For mixtures of a…

2014-02-19abs ↗pdf ↗

5D gauge theories are dual to 3D and 2D models via Floer homologies.

problem Exploring dualities in 5D gauge theories and their 3D and 2D counterparts.
method Using Landau-Ginzburg models and Floer homologies, the paper establishes dualities between different gauge theories and their associated homologies.
result Dual AA_\infty-categories of Floer homologies are derived, proving mirror symmetry and Langlands duality.

Introduces Lax-Kirchhoff moduli spaces for quivers and Lie groups.

problem Constructing moduli spaces for quivers and Lie groups.
method Introduces Lax equations and Kirchhoff conditions, constructs slices, and uses Marsden-Weinstein reduction.
result Proves M(Γ)\mathcal{M}(Γ) is a finite-dimensional smooth symplectic manifold with a Hamiltonian action of GΓG^{\partialΓ}.

A new algorithm reduces the time and space complexity for multinomial logistic bandits.

problem High-dimensional feedback in multinomial logistic bandits makes existing algorithms inefficient.
method Integrates frequent directions matrix sketching into OFUL-MLogB to reduce time and space complexity.
result Achieves a regret bound of ildeO(ΔT(KdlnΔT+m)T) ilde{\mathcal{O}}(Δ_T(Kd\lnΔ_T+m)\sqrt{T}).

New method reduces computational cost of Gaussian process regression.

problem High computational cost of exact Gaussian process inference for large datasets.
method Sparse variational inference with MNM \ll N inducing variables.
result KL-divergence between approximate and exact posterior can be made arbitrarily small.

Proposes a model to generate 3D-aware images from 2D images.

problem Generating 3D-aware images from 2D images.
method Likelihood-based top-down model using Neural Radiance Fields and energy-based latent variables.
result Model can infer 3D object structures from 2D images and generate novel views.

The study proves that in normal tilings, at least two vertices are required per cell.

problem Understanding the minimum number of vertices required in normal tilings.
method The research examines both periodic and monohedral tilings in 2D, proving the minimum number of non-smooth vertices required.
result The study confirms that for normal tilings, at least two vertices are necessary per cell.

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.

We use the conformal invariance and the holographic correspondence to fully specify the dependence of entanglement entropy on the extrinsic geometry of the 2d surface ΣΣ that separates two subsystems of quantum strongly coupled N=4{\mathcal{N}}=4 SU(N) superconformal gauge theory. We extend this result and calculate en…

2008-02-21abs ↗pdf ↗

A novel method compresses point cloud attributes by folding them onto a 2D grid.

problem Efficiently compressing point cloud attributes for storage and transmission.
method Interpreting point clouds as 2D manifolds, folding onto a grid, and mapping attributes to the grid using optimized methods.
result The proposed folding-based approach achieves performance comparable to state-of-the-art codecs.

Paper classifies brain signals using eigenvalues for 2D and 3D educational content questions.

problem Classifying brain signals for 2D and 3D educational content questions.
method Eigenvalues of covariance matrix used as features; KNN and SVM classifiers applied.
result No significant difference in learning, memory retention, and recall between 2D and 3D educational content.

The paper explores gauge theory invariants and their duals via topological-holomorphic twist.

problem Understanding gauge theory invariants and their duals in 4d and 2d.
method Topological-holomorphic twist of N=4 supersymmetric gauge theory.
result Derived novel topological and holomorphic invariants and their Langlands duals.

Paper presents efficient algorithms for robust PCA with reduced computational complexity.

problem Robust PCA in fully and partially observed settings, especially when corruptions are present.
method Non-convex optimization approach using gradient descent.
result Significant reduction in computational complexity compared to existing algorithms.