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

199399598797 · Jun 202019922001200920172026
48 results for neural substrate

Deep neural networks map brain lesions to deficits for better brain function understanding.

problem Mapping the functional brain organization from pathological lesions.
method Deep generative neural network architectures, specifically variational convolutional volumetric auto-encoders.
result Our model outperforms established methods in lesion-deficit inference across various scenarios.

GNNs improve brain activity forecasting in fMRI studies.

problem Understanding neural dynamics in the brain.
method Comparison of GNN architectures for modeling fMRI data.
result GNNs outperform VAR models in robustly scaling to large network studies.

A new hierarchy quantifies agency in systems based on information processing.

problem Lack of a measurable, universal definition for agency in intelligent systems.
method Developed a bottom-up framework based on information processing hierarchy.
result Identified three orders of information processing (I, II, III) as necessary for agency.

The implementation of artificial neural networks in hardware substrates is a major interdisciplinary enterprise. Well suited candidates for physical implementations must combine nonlinear neurons with dedicated and efficient hardware solutions for both connectivity and training. Reservoir computing addresses the proble…

2019-07-23abs ↗pdf ↗

We establish that equally-spaced smectic configurations enjoy an infinite-dimensional conformal symmetry and show that there is a natural map between them and null hypersurfaces in maximally-symmetric spacetimes. By choosing the appropriate conformal factor it is possible to restore additional symmetries of focal struc…

2011-11-30abs ↗pdf ↗

A neural atlas simplifies 3D geometry simulation by avoiding meshing.

problem Simulation of complex 3D geometries with thin features or non-trivial topology.
method Learned geometric representation of overlapping volumetric coordinate charts, trained from point-cloud or level-set data.
result The learned atlas enables different solvers without re-meshing or re-parametrization.

This thesis explores emergent intelligence in disordered systems like spin glasses and neural networks.

problem Understanding the principles behind emergent intelligent behaviors in disordered systems.
method Statistical physics approach to charting learning mechanisms and dynamics.
result Uncovering relationships between learning mechanisms and physical dynamics.

New Heintze-Karcher inequality helps understand droplet shapes.

problem Characterize the shape of droplets inside smooth containers.
method Obtained a new form of the Heintze-Karcher inequality for mean convex hypersurfaces with boundary on curved substrates.
result New mathematical inequality aids in understanding droplet shapes.

The study learns neural update rules by remembering past experiences.

problem Developing efficient online learning rules for neural networks.
method Representing neurons with vectors, using meta-neural networks for updates, and training for remembering past experiences.
result The approach reveals insights into learning rules and could be used for complex tasks like episodic memory.

Multiplicative stochasticity such as Dropout improves the robustness and generalizability of deep neural networks. Here, we further demonstrate that always-on multiplicative stochasticity combined with simple threshold neurons are sufficient operations for deep neural networks. We call such models Neural Sampling Machi…

2019-10-27abs ↗pdf ↗

We explore the use of graph neural networks (GNNs) to model spatial processes in which there is no a priori graphical structure. Similar to finite element analysis, we assign nodes of a GNN to spatial locations and use a computational process defined on the graph to model the relationship between an initial function de…

2019-04-18abs ↗pdf ↗

MEGAN models chemical reactions as graph edits, improving synthesis planning.

problem Generating and predicting chemical reactions under constraints.
method End-to-end encoder-decoder neural model inspired by arrow pushing formalism.
result State-of-the-art accuracy in standard benchmarks for retrosynthesis prediction.

We consider a disk-shaped thin elastic sheet bonded to a compliant sphere. (Our sheet can slip along the sphere; the bonding controls only its normal displacement.) If the bonding is stiff (but not too stiff), the geometry of the sphere makes the sheet wrinkle to avoid azimuthal compression. The total energy of this sy…

2016-11-06abs ↗pdf ↗

Financial asset markets are sociotechnical systems whose constituent agents are subject to evolutionary pressure as unprofitable agents exit the marketplace and more profitable agents continue to trade assets. Using a population of evolving zero-intelligence agents and a frequent batch auction price-discovery mechanism…

2018-12-13abs ↗pdf ↗

Enhances disease progression modeling using LLMs for complex brain connectivity.

problem Inaccurate predictions of disease spread due to oversimplified brain connectivity models.
method Uses LLMs to synthesize multi-modal relationships and learn disease trajectories from longitudinal data.
result Superior prediction accuracy and interpretability compared to traditional methods.

An increasing body of evidence suggests that the trial-to-trial variability of spiking activity in the brain is not mere noise, but rather the reflection of a sampling-based encoding scheme for probabilistic computing. Since the precise statistical properties of neural activity are important in this context, many model…

2018-09-21abs ↗pdf ↗

GeomHerd predicts herding behavior before market prices move, using Ricci curvature of agent interaction graphs.

problem Quantifying herding behavior in markets that lags behind actual price movements.
method Develops a geometric framework to track coordination on agent interaction graphs, bypassing lag in price-correlation statistics.
result GeomHerd anticipates herding long before market baselines, with significant lead times in predictions.

Study predicts social relationships using triadic influence from social networks.

problem Difficulty in quantifying social relationships and their dynamics.
method Real social networks of 13 schools, neural networks, high-dimensional embedding.
result Triadic influence achieves highest accuracy in predicting student relationships.

A framework compares image representations based on local geometry.

problem Comparing image representations based on global structure overlooks local differences.
method Quantify local geometry using Fisher information matrix and optimize differentiation with principal distortions.
result Identifies differences in local sensitivities between models.

We present a principled framework to address resource allocation for realizing boosting algorithms on substrates with communication or computation noise. Boosting classifiers (e.g., AdaBoost) make a final decision via a weighted vote from the outputs of many base classifiers (weak classifiers). Suppose that the base cl…

2019-09-10abs ↗pdf ↗

METRO predicts reactions using minimal templates, reducing computational overhead and achieving state-of-the-art results.

problem Predicting possible reaction substrates for complex molecules from simpler precursors.
method METRO (Molecule-Edit Templates for RetrOsynthesis) uses minimal templates to predict reactions efficiently and accurately.
result METRO achieves state-of-the-art results on standard benchmarks, reducing computational overhead.

The Conant-Ashby theorem is verified for hypergraph observers, leading to unique learning rules.

problem Verifying conditions for hypergraph observers to maintain internal models.
method Formalizing persistent observers, applying the Conant-Ashby theorem, and using natural gradient descent.
result Natural gradient descent is the unique admissible learning rule for hypergraph observers.

GPMI method interpolates uncertain atrial conduction velocity on non-Euclidean manifolds.

problem Uncertainty in atrial conduction velocity calculations.
method Gaussian Process Manifold Interpolation (GPMI) on human atrial manifolds.
result GPMI accounts for atrial topology and calculates CV uncertainty.

Method improves microbial biomass yield estimation from noisy data.

problem Estimating microbial biomass yields from noisy cell counts and substrate measurements.
method Probabilistic macrochemical modeling to relax cell weight assumptions and improve robustness.
result Model provides accurate uncertainty estimates of key parameters.

Quantum systems with scrambling improve temporal information processing, but scaling requires exponential overhead.

problem Scalability and memory retention of quantum reservoirs in temporal information processing.
method Examined a quantum reservoir processing framework with scrambling reservoirs modeled by high-order unitary designs, analyzed in noiseless and noisy settings.
result Memory retention improves exponentially with reservoir size but worsens with reservoir iterations, requiring exponential shot overhead for scaling.

The paper models financial order books using geometric shears and directional liquidity.

problem Understanding the geometry and dynamics of financial order books.
method Structural framework modeling liquidity as emergent observables, geometric shears, and directional imbalances.
result The geometry of financial order books can be described by a rigid drift and geometric shear, leading to a gamma-like profile of projected liquidity.

Agent-to-agent finance aims to manage payments and trust for AI agents.

problem Managing financial interactions between autonomous AI agents.
method Develops agent-to-agent finance concept and explores blockchain solutions.
result Agent-to-agent finance can address coordination frictions in financial markets.

Transformers mimic Bayesian reasoning in controlled settings, revealing geometric mechanisms.

problem Verifying if transformers perform Bayesian reasoning rigorously in natural data.
method Constructing Bayesian wind tunnels with known posteriors and proving memorization impossibility.
result Transformers achieve 10310^{-3}-10410^{-4} bit accuracy in Bayesian posteriors, while MLPs fail.

Quantum ELMs use a quantum reservoir to learn from data, with limits on expressivity and scalability.

problem Understanding the limits of quantum ELMs for machine learning tasks.
method Decomposed QELM predictions into Fourier series to analyze expressivity and scalability.
result Expressivity of QELMs is limited by the number of Fourier frequencies and observables, and scalability is hindered by hardware noise and entanglement.