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

232464695927 · Jun 202019922001200920172026
48 results for power functional theory

Paper detects and estimates breaks in high-dimensional functional time series.

problem Detecting and estimating structural breaks in heterogeneous mean functions of high-dimensional functional time series.
method Proposes a new test statistic combining functional CUSUM and power enhancement components, with a clustering algorithm for group structure estimation.
result The proposed techniques have satisfactory performance in finite samples, detecting and estimating breaks effectively.

In a recent Nature paper, Gabaix et al. \cite{Gabaix03} presented a theory to explain the power law tail of price fluctuations. The main points of their theory are that volume fluctuations, which have a power law tail with exponent roughly -1.5, are modulated by the average market impact function, which describes the r…

2003-09-17abs ↗pdf ↗

Deep neural networks can approximate complex functions through repeated compositions of a fixed-size ReLU network.

problem Understanding the expressive power of deep neural networks through function compositions.
method Demonstrated the surprising expressive power of repeated compositions of a single fixed-size ReLU network.
result Repeated compositions of a single fixed-size ReLU network can approximate 1-Lipschitz continuous functions on [0,1]d[0,1]^d with an error O(r1/d)\mathcal{O}(r^{-1/d}).

The abstract discusses parallels between Galois theory and Stone-Weierstrass theorem in various fields.

problem Connecting distinguishing power and expressive power in different fields.
method Elementary theorem connecting distinguishing power and expressive power.
result Foundational principle in linguistics linking distinguishing power and expressive power.

The paper extends topological field theory to noncompact surfaces using symmetric powers.

problem Extending topological field theory to noncompact surfaces without closed boundaries.
method Constructing sectorial covers with combinatorics of the bar resolution.
result Recovering results of Rouquier and Manion on extending Heegaard-Floer theory.

Deep, wide ConvResNets can approximate functions and their smoothness.

problem Function approximation and smoothness in deep networks.
method Analyzing ConvResNets, proving their ability to approximate functions and their smoothness.
result Large ConvResNets can approximate functions and exhibit sufficient first-order smoothness.

The Murphy operators in the Hecke algebra H_n of type A are explicit commuting elements, whose symmetric functions are central in H_n. In [Skein theory and the Murphy operators, J. Knot Theory Ramif. 11 (2002), 475-492] I defined geometrically a homomorphism from the Homfly skein C of the annulus to the centre of each …

2001-11-08abs ↗pdf ↗

The recent research report of U.S. Department of Energy prompts us to re-examine the pricing theories applied in electricity market design. The theory of spot pricing is the basis of electricity market design in many countries, but it has two major drawbacks: one is that it is still based on the traditional hourly sche…

2017-10-22abs ↗pdf ↗

Randomly initialized ReLU networks of depth two can approximate smooth functions well.

problem Approximation power of two-layer networks of random ReLUs.
method Harmonic analysis and ridgelet representation theory for upper bounds, dimensionality arguments for lower bounds.
result Near-matching upper and lower bounds for L2L_2-approximation and Sobolev norms.

Many biological learning systems such as the mushroom body, hippocampus, and cerebellum are built from sparsely connected networks of neurons. For a new understanding of such networks, we study the function spaces induced by sparse random features and characterize what functions may and may not be learned. A network wi…

2019-09-05abs ↗pdf ↗

It is shown phenomenologically that the fractional derivative ξ=Dαuξ=D^αu of order αα of a multifractal function has a power-law tail ξp\propto |ξ| ^{-p_\star} in its cumulative probability, for a suitable range of αα's. The exponent is determined by the condition ζp=αpζ_{p_\star} = αp_\star, where ζpζ_p is the exponent of…

2001-07-25abs ↗pdf ↗

Constructs new topological theories in 2D not fitting standard axioms.

problem Developing new topological theories in 2D that don't conform to traditional axioms.
method Universal construction by Blanchet et al., Kronecker's characterization, field extension, Hankel matrices, Schur polynomials, and foam evaluation.
result Introduction of non-multiplicative theories and classification over finite-dimensional state spaces.

Deep residual networks can approximate any continuous function using control theory.

problem Universal approximation capabilities of deep residual neural networks.
method Relating residual networks to control systems and using Lie algebraic techniques.
result Deep residual networks with adequately deep layers can approximate any continuous function on a compact set.

Quantum dilogarithm function proven from a linear difference equation.

problem Proving Faddeev's quantum dilogarithm from a linear difference equation.
method Proved Faddeev's quantum dilogarithm using Borel summation of a formal power series solution of a linear difference equation.
result Borel summation of a formal power series solution produces Faddeev's quantum dilogarithm.

Using a model based on generalised Lotka Volterra dynamics together with some recent results for the solution of generalised Langevin equations, we show that the equilibrium solution for the probability distribution of wealth has two characteristic regimes. For large values of wealth it takes the form of a Pareto style…

2000-10-16abs ↗pdf ↗

Neural network models colloidal particle dynamics in non-equilibrium systems.

problem Analyzing non-equilibrium dynamics of many-body colloidal systems.
method Combining power functional theory and machine learning, training a neural network to predict internal force fields.
result The neural network accurately predicts dynamics in non-equilibrium systems, in good agreement with simulations.

Theory explains power-law distributions without complex models.

problem Understanding power-law distributions in geometrically growing systems.
method Developed a theory of geometrically growing systems and applied it to explain various distributions.
result The geometrically growing system's distribution flattens over time, increasing relative size ratios.

In this note, we point out a basic link between generative adversarial (GA) training and binary classification -- any powerful discriminator essentially computes an (f-)divergence between real and generated samples. The result, repeatedly re-derived in decision theory, has implications for GA Networks (GANs), providing…

2017-09-05abs ↗pdf ↗

We give an overview of the generalized Calderón-Zygmund theory for "non-integral" singular operators, that is, operators without kernels bounds but appropriate off-diagonal estimates. This theory is powerful enough to obtain weighted estimates for such operators and their commutators with $\BMO$ functions. LpLqL^p-L^q of…

2008-10-17abs ↗pdf ↗

For any prime power qq and any dimension ss, a new construction of (t,s)(t,s)-sequences in base qq using global function fields is presented. The construction yields an analog of Halton sequences for global function fields. It is the first general construction of (t,s)(t,s)-sequences that is not based on the digital metho…

2012-10-29abs ↗pdf ↗

Improves conformal prediction by combining multiple score functions and optimizing weights.

problem Limitations of single-score conformal predictors in multi-class classification.
method Combines multiple score functions and optimizes weights to minimize prediction set size.
result Consistently outperforms single-score conformal predictors while maintaining valid coverage.

Unified theory for neural scaling laws in hierarchically compositional data.

problem Understanding neural scaling laws in hierarchically compositional data.
method Probabilistic context-free grammars and power-law distributed production rules.
result Unified learning curve behavior for classification and next-token prediction tasks.

This research simplifies computation of feature attribution methods under certain conditions.

problem Computational complexity of feature attribution methods, especially power indices.
method Identifying conditions for polynomial computation and introducing new indices.
result Conditions for efficient computation of feature attribution methods are identified.

Power series invariant of hyperbolic 3-manifolds matches knot invariants.

problem Understanding topological invariants of hyperbolic 3-manifolds.
method Perturbative power series associated with ideally triangulated cusped hyperbolic 3-manifolds.
result The power series agrees with Kashaev and Andersen-Kashaev invariants to all orders.

Improved bounds on acylindricity for right-angled Artin groups.

problem Bounding the acylindrical action of right-angled Artin groups on their extension graphs.
method Exploring lattice properties, studying prefixes of powers, and extending quasi-root uniqueness.
result Cardinality of rr-quasi-stabilizer is bounded by a linear function of rr.

Racks and quandles are rich algebraic structures that are strong enough to classify knots. Here we develop several fundamental categorical aspects of the theories of racks and quandles and their relation to the theory of permutations. In particular, we compute the centers of the categories and describe power operations…

2016-09-27abs ↗pdf ↗

A new method compares synthetic power networks to actual ones using multiscale flat norm.

problem Comparing synthetic power networks to actual ones due to lack of correspondence.
method Proposes a multiscale flat norm approach to compute distance between networks.
result The flat norm distance captures variations more accurately than Hausdorff distance.