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

295886115 · Jun 202619922001200920172026
48 results for Conformal blocks

Based on projective representations of smooth Deligne cohomology groups, we introduce an analogue of the space of conformal blocks to compact oriented (4k+2)-dimensional Riemannian manifolds with boundary. For the standard (4k+2)-dimensional disk, we compute the space concretely to prove that its dimension is finite.

2007-05-25abs ↗pdf ↗

Study risk-controlling prediction sets for single trajectory data from dynamical systems.

problem Performance guarantees for risk-controlling prediction sets in single trajectory data from unknown stochastic dynamical systems.
method Used blocking and decoupling techniques to analyze performance guarantees under different data generating processes.
result Performance guarantees similar to iid setting when data is stationary and contractive, with graceful degradation otherwise.

The central discovery of 2d2d conformal theory was holomorphic factorization, which expressed correlation functions through bilinear combinations of conformal blocks, which are easily cut and joined without a need to sum over the entire huge Hilbert space of states. Somewhat similar, when a link diagram is glued from t…

2018-04-19abs ↗pdf ↗

Enhances ocean floor mapping with adaptive uncertainty estimates.

problem Inaccurate bathymetric data for precise ocean modeling.
method Block-based conformal prediction with VQ-VAE architecture.
result Significant improvements in reconstruction quality and uncertainty estimation reliability.

Arithmetic Dijkgraaf-Witten theory constructs analogues in Chern-Simons TQFT.

problem Developing arithmetic analogues in Chern-Simons TQFT.
method Constructing arithmetic analogues of Chern-Simons 1-cocycle, prequantization bundle, and Chern-Simons functional.
result Decomposition and gluing formulas for arithmetic Chern-Simons invariants and arithmetic Dijkgraaf-Witten partition functions.

We illustrate from the viewpoint of braiding operations on WZNW conformal blocks how colored HOMFLY polynomials with multiplicity structure can detect mutations. As an example, we explicitly evaluate the (2,1)-colored HOMFLY polynomials that distinguish a famous mutant pair, Kinoshita-Terasaka and Conway knot.

2015-04-01abs ↗pdf ↗

The paper defines a Chern-Simons invariant for stably trivial vector bundles and uses it to obstruct conformal immersions.

problem Obstructing conformal immersions of Riemannian manifolds.
method Defining a Chern-Simons invariant for stably trivial vector bundles and using it to derive an obstruction.
result An obstruction for conformally immersing a n-dimensional Riemannian manifold in a translation manifold of dimension n+1.

The behavior under conformal change of the renormalized volume coefficients associated to a pseudo-Riemannian metric is investigated. It is shown that they define second order fully nonlinear operators in the conformal factor whose algebraic structure is elucidated via the introduction of "extended obstruction tensors"…

2008-10-23abs ↗pdf ↗

We classify both local and global Kähler structures admitting totally geodesic homothetic foliations with complex leaves. The main building blocks are related to Swann's twists and are obtained by applying Weinstein's method of constructing symplectic bundles to Kähler data. As a byproduct we obtain new classes of: hol…

2019-09-25abs ↗pdf ↗

Teichmüller TQFT is a unitary 3d topological theory whose Hilbert spaces are spanned by Liouville conformal blocks. It is related but not identical to PSL(2,R) Chern-Simons theory. To physicists, it is known in particular in the context of 3d-3d correspondence and also in the holographic description of Virasoro conform…

2017-10-12abs ↗pdf ↗

It has been argued based on electric-magnetic duality and other ingredients that the Jones polynomial of a knot in three dimensions can be computed by counting the solutions of certain gauge theory equations in four dimensions. Here, we attempt to verify this directly by analyzing the equations and counting their solut…

2011-06-23abs ↗pdf ↗

tsbootstrap handles time series uncertainty without assuming independence.

problem Time series data violate IID assumptions, leading to undercoverage in traditional methods.
method Provides various resampling and bootstrap methods, including classical and adaptive conformal calibration.
result Dependence-aware methods reduce coverage deficits, with sieve resampling performing best.

Normalizing flows can now estimate densities on unknown manifolds.

problem Normalizing flows struggle with data on unknown low-dimensional manifolds.
method Conformal Embedding Flows, which combine standard flows with trainable conformal embeddings.
result Tractable density estimation on manifold-supported data is possible.

A very simple expression is conjectured for arbitrary colored Jones and HOMFLY polynomials of a rich (g+1)(g+1)-parametric family of Pretzel knots and links. The answer for the Jones and HOMFLY polynomials is fully and explicitly expressed through the Racah matrix of U_q(SU_N), and looks related to a modular transformatio…

2014-12-08abs ↗pdf ↗

SubSearch detects graph outliers and estimates SBM parameters robustly.

problem Real-world graphs often deviate from ideal SBM assumptions.
method Subgraph search to find subgraphs that align with SBM assumptions.
result SubSearch accurately estimates SBM parameters and detects outliers.

A new deep learning framework selects representative samples for unsupervised learning.

problem Selecting representative samples for unsupervised learning in non-linear data.
method DUAL framework using an encoder-decoder architecture to learn nonlinear embeddings and a selection block to choose representative samples.
result DUAL outperforms state-of-the-art methods in selecting representative samples for unsupervised learning.

Quantizes geodesic lengths in Teichmüller spaces using algebraic methods.

problem Constructing quantized geodesic lengths for Teichmüller spaces.
method Developed quantum trace maps and investigated algebraic structures.
result Showed a recursion relation and commutation properties for quantized trace-of-monodromy.

This paper shows connections between two complex mathematical theories are equivalent.

problem Establishing equivalence between two complex mathematical theories.
method Using geometric quantisation and conformal field theory, the paper establishes equivalence between the Hitchin connection and the Knizhnik-Zamolodchikov connection.
result The Hitchin and Knizhnik-Zamolodchikov connections are projectively equivalent in genus zero.

This paper presents a novel Block Iterative Bayesian Algorithm (Block-IBA) for reconstructing block-sparse signals with unknown block structures. Unlike the existing algorithms for block sparse signal recovery which assume the cluster structure of the nonzero elements of the unknown signal to be independent and identic…

2014-12-07abs ↗pdf ↗

This letter presents a novel Block Bayesian Hypothesis Testing Algorithm (Block-BHTA) for reconstructing block sparse signals with unknown block structures. The Block-BHTA comprises the detection and recovery of the supports, and the estimation of the amplitudes of the block sparse signal. The support detection and rec…

2015-08-22abs ↗pdf ↗

In the search for appropriate discretizations of surface theory it is crucial to preserve such fundamental properties of surfaces as their invariance with respect to transformation groups. We discuss discretizations based on Möbius invariant building blocks such as circles and spheres. Concrete problems considered in t…

2007-07-09abs ↗pdf ↗

Abstract: Mapping class groups act on cohomology of surfaces via Hochschild cohomology.

problem Understanding the action of mapping class groups on cohomology of surfaces.
method Associate cochain complexes to surfaces, with mapping class groups acting projectively on cohomology.
result Projective action of mapping class groups on Hochschild cohomology of Hopf algebras.

There exist various types of network block models such as the Stochastic Block Model (SBM), the Degree Corrected Block Model (DCBM), and the Popularity Adjusted Block Model (PABM). While this leads to a variety of choices, the block models do not have a nested structure. In addition, there is a substantial jump in the …

2020-02-07abs ↗pdf ↗

SympFormer accelerates attention blocks using inertial dynamics on density spaces.

problem Improving the efficiency of self-attention blocks in Transformers.
method Introduced accelerated attention blocks derived from inertial Nesterov dynamics on density spaces.
result Accelerated attention blocks converge faster than classical blocks while preserving oracle calls.

We introduce block-tree graphs as a framework for deriving efficient algorithms on graphical models. We define block-tree graphs as a tree-structured graph where each node is a cluster of nodes such that the clusters in the graph are disjoint. This differs from junction-trees, where two clusters connected by an edge al…

2010-07-04abs ↗pdf ↗

We simplify matrix computations for block matrices, especially useful for covariance and correlation matrices.

problem Complex computations for block matrices, especially for covariance and correlation matrices.
method Obtained a canonical representation for block matrices, facilitating computation of various matrix operations.
result Simplified computation of matrix operations for block matrices, particularly useful for covariance and correlation matrices.

Attention mechanism is a hot spot in deep learning field. Using channel attention model is an effective method for improving the performance of the convolutional neural network. Squeeze-and-Excitation block takes advantage of the channel dependence, selectively emphasizing the important channels and compressing the rel…

2019-01-06abs ↗pdf ↗

Proposes BMME for optimizing nonsmooth nonconvex problems with block structure.

problem Optimizing nonsmooth nonconvex problems with block structure.
method Block Alternating Bregman Majorization Minimization with Extrapolation (BMME).
result Subsequential convergence to a first-order stationary point under mild assumptions, global convergence under stronger conditions.

Alternating Direction Method of Multipliers (ADMM) has become a widely used optimization method for convex problems, particularly in the context of data mining in which large optimization problems are often encountered. ADMM has several desirable properties, including the ability to decompose large problems into smalle…

2019-07-10abs ↗pdf ↗

Paper proposes ABDR for convex subspace clustering with adaptive block diagonal representation.

problem Subspace clustering with block diagonal structure for noisy data.
method ABDR explicitly pursues block diagonality without sacrificing convexity, using a specially designed convex regularizer.
result Experimental results show ABDR outperforms state-of-the-arts.

We consider practical data characteristics underlying federated learning, where unbalanced and non-i.i.d. data from clients have a block-cyclic structure: each cycle contains several blocks, and each client's training data follow block-specific and non-i.i.d. distributions. Such a data structure would introduce client …

2020-02-18abs ↗pdf ↗

In the present paper we study a sparse stochastic network enabled with a block structure. The popular Stochastic Block Model (SBM) and the Degree Corrected Block Model (DCBM) address sparsity by placing an upper bound on the maximum probability of connections between any pair of nodes. As a result, sparsity describes o…

2019-10-03abs ↗pdf ↗

Incorporating deep neural networks in image compressive sensing (CS) receives intensive attentions in multimedia technology and applications recently. As deep network approaches learn the inverse mapping directly from the CS measurements, the reconstruction speed is significantly faster than the conventional CS algorit…

2019-08-28abs ↗pdf ↗

Continuous-depth Evoformer reduces protein folding prediction time and resource usage.

problem Efficient protein structure prediction with reduced computational costs.
method Continuous-depth formulation of Evoformer using Neural Ordinary Differential Equations (Neural ODEs).
result The continuous-time Evoformer achieves constant memory cost and improved efficiency.

New formula calculates loss from arbitrage in blockchain liquidity pools.

problem Calculating loss from arbitrage in Automated Market Makers (AMMs) under varying block times.
method Derived a closed-form approximation for expected loss using random walk theory.
result The formula approximates the loss from arbitrage with high accuracy and shows that constant block intervals minimize this loss.