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

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for expressivity condition

New algorithm ensures global convergence in deep neural networks beyond NTK regime.

problem Existing global convergence guarantees do not apply to practical deep networks.
method Proposes an algorithm with global convergence guarantees under the expressivity condition.
result Algorithm ensures global convergence in practical settings beyond NTK regime.

Quantized neural networks can represent all fixed-point functions under certain conditions.

problem Expressive power of quantized neural networks under fixed-point arithmetic.
method Analyzing necessary and sufficient conditions for quantized networks to represent all fixed-point functions.
result Various popular activation functions satisfy the sufficient condition for representing all fixed-point functions.

Neural-Kernel CME tackles scalability and expressiveness challenges in conditional distribution representation.

problem Scalability and expressiveness challenges in kernel conditional mean embeddings.
method Combines deep learning with CMEs using a neural network optimization framework.
result Achieves competitive and often superior performance in conditional density estimation and RL.

In this paper, we describe the "implicit autoencoder" (IAE), a generative autoencoder in which both the generative path and the recognition path are parametrized by implicit distributions. We use two generative adversarial networks to define the reconstruction and the regularization cost functions of the implicit autoe…

2018-05-24abs ↗pdf ↗

New framework explains normalizing flows' power and limitations.

problem Understanding the expressive power and limitations of normalizing flows.
method Theoretical framework for well-conditioned coupling-based normalizing flows and volume-preserving flows.
result RealNVP is distributionally universal, but volume-preserving flows are not.

Deep neural networks approximate option prices in high-dimensional Lévy models efficiently.

problem Approximating option prices in high-dimensional financial models with jumps.
method Use of deep ReLU neural networks to approximate option prices in multivariate Lévy processes with polynomial growth in network size and dimension.
result Established sufficient conditions for polynomial growth in network size and dimension to approximate option prices with error ε.

Proves properties of neural network basins of attraction and their expressiveness.

problem Characterize the properties of basins of attraction in neural networks.
method Analyzes width-bounded neural networks, proving properties of basins of attraction.
result Boundedness and path-connectedness of basins of attraction under certain conditions.

We present a novel tractable generative model that extends Sum-Product Networks (SPNs) and significantly boosts their power. We call it Sum-Product-Quotient Networks (SPQNs), whose core concept is to incorporate conditional distributions into the model by direct computation using quotient nodes, e.g. $P(A|B) = \frac{P(…

2017-10-12abs ↗pdf ↗

The paper explores risk-minimization for exponential additive models, providing mathematical expressions and numerical examples.

problem Risk-minimization in incomplete markets for exponential additive models.
method Derive explicit mathematical expressions for local risk-minimization strategies in exponential additive models.
result Provide necessary conditions for deriving expressions and confirm integrability conditions for specific models.

New model generates realistic single-cell gene expression data.

problem Generating realistic single-cell gene expression profiles is challenging.
method scLDM, a latent diffusion model using Diffusion Transformers and linear interpolants.
result Superior performance in generating realistic single-cell gene expression data.

Research provides explicit NPV expressions for double barrier strategies.

problem Calculating expected NPVs of double barrier strategies for regular diffusions.
method Explicit expression using bivariate q-scale function with perturbation technique.
result Explicit expressions for expected NPVs are derived for certain cases.

Symbolic regression is a type of discrete optimization problem that involves searching expressions that fit given data points. In many cases, other mathematical constraints about the unknown expression not only provide more information beyond just values at some inputs, but also effectively constrain the search space. …

2019-01-23abs ↗pdf ↗

Weisfeiler-Leman struggles with graph isomorphism; enhanced architectures improve generalization.

problem Graph isomorphism problem and limited expressivity of 11-WL.
method Augmenting 11-WL and MPNNs with subgraph information, employing margin theory, and introducing provable generalization kernels.
result Increased expressivity of graph neural networks and kernels does not necessarily correlate with improved generalization performance.

Researchers derived formulas for joint moments of elliptical distributions.

problem Calculating joint moments of elliptical distributions.
method Used Stein's lemma and two different methods to derive expressions.
result New formulae for expectations of product of normally distributed random variables and simplified expressions for other distributions.

Deep Gaussian Processes (DGPs) were proposed as an expressive Bayesian model capable of a mathematically grounded estimation of uncertainty. The expressivity of DPGs results from not only the compositional character but the distribution propagation within the hierarchy. Recently, [1] pointed out that the hierarchical s…

2020-02-07abs ↗pdf ↗

In this paper we explore the functional correlation approach to operational risk. We consider networks with heterogeneous a-priori conditional and unconditional failure probability. In the limit of sparse connectivity, self-consistent expressions for the dynamical evolution of order parameters are obtained. Under equil…

2006-09-14abs ↗pdf ↗

In the Batalin-Vilkovisky formalism, gauge conditions are expressed as Lagrangian submanifolds in the space of fields and antifields. We discuss a way of patching together gauge conditions over different parts of the space of fields, and apply this method to extend the light-cone gauge for the superparticle to a conic …

2019-11-25abs ↗pdf ↗

The Ma-Trudinger-Wang curvature --- or cross-curvature --- is an object arising in the regularity theory of optimal transportation. If the transportation cost is derived from a Hamiltonian action, we show its cross-curvature can be expressed in terms of the associated Jacobi fields. Using this expression, we show the l…

2009-08-31abs ↗pdf ↗

This paper compares HMC and RNN expressivity using SRT.

problem Comparing expressivity of HMC and RNN models.
method Embed HMC and RNN in a GUM, use SRT to compare structured covariance series.
result Conditions for realizing covariance series by GUM, HMC, or RNN.

Study inextensible flows of curves in 4D pseudo-Galilean space and defines energy functions.

problem Analyzing inextensible flows and energy of curves in 4D pseudo-Galilean space.
method Expressed inextensible flows as partial differential equations, defined directional derivatives, and expressed bending elastic energy functions.
result Necessary and sufficient conditions for inextensible flows are given as partial differential equations.

A non-Euclidean generalization of conditional expectation is introduced and characterized as the minimizer of expected intrinsic squared-distance from a manifold-valued target. The computational tractable formulation expresses the non-convex optimization problem as transformations of Euclidean conditional expectation. …

2017-10-16abs ↗pdf ↗

New approach decouples skill learning and language grounding for autonomous agents.

problem Autonomous acquisition of skills without external instructions and feedback.
method Language-Goal-Behavior (LGB) architecture with semantic representation.
result Decouples skill learning and language grounding, enabling diversity and strategy switching.

SPECTRE uses spectral conditioning to generate larger graphs without mode collapse.

problem Overcoming expressivity and mode collapse in one-shot graph generators.
method SPECTRE generates graph Laplacian spectrum and eigenvectors to model graph structure.
result SPECTRE outperforms state-of-the-art deep autoregressive generators in fidelity and speed.

Researchers infer gene activity in dividing cells, accounting for protein inheritance and division history.

problem Inferring protein production kinetics in dividing cells due to protein inheritance and division history.
method Adapted conditional normalizing flows to approximate intractable likelihoods from simulated data.
result Glc3 gene is mostly inactive under stress, with brief and transient expression.

We derive general Novikov-Morse type inequalities in a Conley type framework for flows carrying cocycles, therefore generalizing our results in [FJ2] derived for integral cocycle. The condition of carrying a cocycle expresses the nontriviality of integrals of that cocycle on flow lines. Gradient-like flows are distingu…

2003-11-30abs ↗pdf ↗

Data-aware methods for dimensionality reduction and matrix decomposition aim to find low-dimensional structure in a collection of data. Classical approaches discover such structure by learning a basis that can efficiently express the collection. Recently, "self expression", the idea of using a small subset of data vect…

2015-05-04abs ↗pdf ↗

In this paper, we investigate the general formulation for inextensible flows of curves in En. The necessary and sufficient conditions for inextensible curve flow are expressed as a partial differential equation involving the curvatures.

2012-07-06abs ↗pdf ↗

We investigate graph neural networks for multi-relational data.

problem Understanding and improving graph neural networks for multi-relational data.
method Aligning Relational GCN and Compositional GCN with the Weisfeiler-Leman test to understand their expressive power and introduce a new kk-RN architecture.
result The kk-RN architecture overcomes the expressiveness limitations of Relational GCN and Compositional GCN.

Abstract: Expresses zeta-determinant of Dirichlet-to-Neumann operator on forms.

problem Express zeta-determinant of Dirichlet-to-Neumann operator on forms.
method Expresses zeta-determinant as difference of Laplacian determinants with boundary conditions.
result Computes terms explicitly for dimensions 2 and 3.

This paper deals with multidimensional dynamic risk measures induced by conditional gg-expectations. A notion of multidimensional gg-expectation is proposed to provide a multidimensional version of nonlinear expectations. By a technical result on explicit expressions for the comparison theorem, uniqueness theorem and…

2010-11-16abs ↗pdf ↗

Stem uses diffusion models to infer gene expression from H&E images.

problem Inference of gene expression from H&E stained images is time-consuming and expensive.
method Conditional diffusion generative model to infer gene expression.
result Stem achieves state-of-the-art performance in spatial gene expression prediction.

It is shown that under mild conditions, Benjamini-Schramm convergence of lattices in locally compact groups is equivalent to spectral convergence. Next both notions are extended to the relative case and are then expressed in terms of relative L2-theory.

2018-05-18abs ↗pdf ↗

We obtain a formal obstruction, i.e. a necessary condition for the existence of polarised complex deformations of Kähler-Ricci solitons. This obstruction is expressed in terms of the harmonic part of the variation of the complex structure.

2015-07-23abs ↗pdf ↗

New algorithm reduces conditional independence tests needed for causal discovery.

problem Efficiently infer causal relations from observational data.
method Established an algorithm with complexity pO(s)p^{\mathcal{O}(s)} tests.
result Achieves exponent-optimality up to a logarithmic factor in terms of conditional independence tests.

Study efficient interactive learning for structured outputs with reliable computation.

problem Interactive learning with noisy labels and structured output spaces.
method Identify and utilize CRISPs (probabilistic models) that guarantee reliable and efficient computation of probabilistic quantities.
result CRISPs enable robust and efficient active and skeptical learning in large structured output spaces.