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

2356 · Jul 202019922001200920172026
48 results for superposition

Superposition rules form a class of functions that describe general solutions of systems of first-order ordinary differential equations in terms of generic families of particular solutions and certain constants. In this work we extend this notion and other related ones to systems of higher-order differential equations …

2011-11-17abs ↗pdf ↗

Mixed superposition rules, i.e., functions describing the general solution of a system of first-order differential equations in terms of a generic family of particular solutions of first-order systems and some constants, are studied. The main achievement is a generalization of the celebrated Lie-Scheffers Theorem, char…

2012-03-01abs ↗pdf ↗

In many learning tasks, structural models usually lead to better interpretability and higher generalization performance. In recent years, however, the simple structural models such as lasso are frequently proved to be insufficient. Accordingly, there has been a lot of work on "superposition-structured" models where mul…

2015-09-08abs ↗pdf ↗

The paper develops methods to derive mixed superposition rules for Lie systems and applies them to various physical systems.

problem Finding general solutions for Lie systems.
method Develops mixed superposition rules for Lie systems with imprimitive Lie algebras and semidirect sums.
result Extends coalgebra method to Lie systems of partial differential equations.

Quantum machine learning uses superposition to create a large ensemble of classifiers.

problem Improving machine learning efficiency on quantum computers.
method Using superposition to create an exponentially large ensemble of classifiers, trained with an optimization-free learning algorithm.
result Adding an optimization step improves the performance of quantum ensembles of classifiers.

Formulae for Bäcklund transformations of hyperbolic and elliptic sine-Gordon/sinh-Gordon equations.

problem Finding solutions for specific types of equations.
method Providing superposition formulae for Bäcklund transformations.
result Algebraically obtain infinitely many solutions after first integration.

New algorithm extracts features from superpositions in machine learning models.

problem Challenges in extracting interpretable features from complex models in superposition.
method An efficient query algorithm that identifies non-degenerate feature directions and reconstructs the function.
result Identifies all feature directions whose responses are non-degenerate and reconstructs the function \( f \) in a general superposition setting.

High dimensional superposition models characterize observations using parameters which can be written as a sum of multiple component parameters, each with its own structure, e.g., sum of low rank and sparse matrices, sum of sparse and rotated sparse vectors, etc. In this paper, we consider general superposition models …

2017-05-30abs ↗pdf ↗

Paper introduces Manifold Probe for discovering representation manifolds in superposition.

problem Discovering representation manifolds in complex superposition representations.
method Generalizes linear regression probes to learn feature spaces and directions in superposition representations.
result Demonstrates Manifold Probe on Llama 2-7b representations, finding causally involved manifolds in model behaviour.

New methods combine model predictions to avoid linear mixtures' limitations.

problem Combining predictions from different models to avoid linear mixtures' limitations.
method Log-linear pooling (locking) and quantum superposition (quacking) to optimise model weights.
result Demonstrated locking method with illustrative example and practical application.

We consider the learning of multi-agent Hawkes processes, a model containing multiple Hawkes processes with shared endogenous impact functions and different exogenous intensities. In the framework of stochastic maximum likelihood estimation, we explore the associated risk bound. Further, we consider the superposition o…

2018-02-13abs ↗pdf ↗

The study examines Euclid's Book I, focusing on area applications and construction methods.

problem Exploring Euclid's geometric constructions and proofs, particularly those involving area calculations.
method Summarizing medieval editions and ancient commentaries, comparing constructions and proofs.
result Medieval editions often avoid Euclid's use of superposition in area proofs, offering alternative constructions.

Paper proposes an algorithm to reconstruct optimal model structure from graph adjacency matrix.

problem Optimal model structure reconstruction from weighted colored graph adjacency matrix.
method Uses prize-collecting Steiner tree algorithm to reconstruct minimum spanning tree.
result Demonstrates the effectiveness of the prize-collecting Steiner tree algorithm for model structure reconstruction.

MIMONets speed up neural network inference by processing multiple inputs in parallel.

problem Reducing computational cost in neural network inference for large datasets.
method Proposes MIMONets, which augment neural network architectures with variable binding mechanisms to handle multiple inputs in superposition.
result Achieves significant speedups (2-4x) with minimal accuracy loss, demonstrating adaptability across different architectures.

Gravitational instantons are constructed as superpositions of Atiyah-Hitchin and Taub-NUT geometries.

problem Constructing gravitational instantons from Atiyah-Hitchin and Taub-NUT geometries.
method A gluing construction that captures the superposition of moduli spaces of centred SU(2) monopoles and Taub-NUT manifolds.
result Gravitational instantons are explicitly shown to be superpositions of Atiyah-Hitchin and Taub-NUT geometries.

We analyze families of non-autonomous systems of first-order ordinary differential equations admitting a common time-dependent superposition rule, i.e., a time-dependent map expressing any solution of each of these systems in terms of a generic set of particular solutions of the system and some constants. We next study…

2010-03-18abs ↗pdf ↗

Quantum computing speeds up asset pricing models exponentially.

problem Solving dynamic nonlinear asset pricing models efficiently.
method Utilizes quantum superposition and entanglement to solve models exponentially faster than classical methods.
result Exponential computational speed-up for solving asset pricing models.

Explores tensor products in hyperdimensional computing.

problem Understanding tensor products in hyperdimensional computing.
method Generalized results from graph embeddings to vector symbolic architectures and hyperdimensional computing.
result Tensor product is the most general and expressive representation with errorless unbinding and detection.

A theory of feature geometry using spectral analysis of weight matrices.

problem Current methods decompose neural network activations into sparse linear features, losing geometric structure.
method Develops a theory by analyzing the spectra of weight-derived matrices, introducing the frame operator.
result Features collapse onto single eigenspaces, organizing into tight frames, and admit discrete classification.

The superposition of temporal point processes has been studied for many years, although the usefulness of such models for practical applications has not be fully developed. We investigate superposed Hawkes process as an important class of such models, with properties studied in the framework of least squares estimation…

2017-10-14abs ↗pdf ↗

This paper proves a version for stochastic differential equations of the Lie-Scheffers Theorem. This result characterizes the existence of nonlinear superposition rules for the general solution of those equations in terms of the involution properties of the distribution generated by the vector fields that define it. Wh…

2008-03-05abs ↗pdf ↗

Defines manifolds of mappings between function spaces and discusses their properties.

problem Defining smooth manifolds of mappings between function spaces.
method Defines a smooth manifold structure on sets of continuous mappings and discusses properties of natural mappings.
result Properties of spaces of sections and smoothness of natural mappings between spaces of mappings.

We fit the volatility fluctuations of the S&P 500 index well by a Chi distribution, and the distribution of log-returns by a corresponding superposition of Gaussian distributions. The Fourier transform of this is, remarkably, of the Tsallis type. An option pricing formula is derived from the same superposition of Black…

2007-08-22abs ↗pdf ↗

Quantum algorithms for multi-armed bandits are explored with limited reward access.

problem Exploring quantum speed-ups in multi-armed bandit problems with limited reward information.
method Introduced new bandit models and showed query complexity equivalence with classical algorithms.
result No quadratic speed-up is possible for multi-armed bandits with limited reward access.

Automated method finds meaningful directions in neural network activations.

problem Mixed selectivity in neurons makes interpretation challenging.
method Automated quantification of interpretability and discovery of meaningful directions.
result Meaningful directions in neural network activations are more interpretable than individual neurons.

In this paper we develop some group theoretical methods which are shown to be very useful for a better understanding of the properties of the Riccati equation and we discuss some of its integrability conditions from a group theoretical perspective. The nonlinear superposition principle also arises in a simple way.

1998-10-07abs ↗pdf ↗

This work concerns the definition and analysis of a new class of Lie systems on Poisson manifolds enjoying rich geometric features: the Lie--Hamilton systems. We devise methods to study their superposition rules, time independent constants of motion and Lie symmetries, linearisability conditions, etc. Our results are i…

2012-11-29abs ↗pdf ↗

Quantum variational circuits improve reinforcement learning efficiency.

problem Improving reinforcement learning algorithms using quantum computing.
method Investigation of quantum variational circuits for DQN and Double DQN, encoding classical data for quantum circuits.
result Quantum variational circuits can solve reinforcement learning tasks with a smaller parameter space.

APD method decomposes neural network parameters into simple, faithful components.

problem Understanding the internal mechanisms learned by neural networks.
method Attribution-based Parameter Decomposition (APD) method.
result Demonstrated effectiveness in recovering features, separating computations, and identifying representations.