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

1223 · Dec 201819922001200920172026
48 results for dreaming

DREAM learns optimal strategies in imperfect games without needing a simulator.

problem Learning optimal strategies in imperfect-information games with multiple agents.
method DREAM is a deep reinforcement learning algorithm that converges to Nash Equilibria and coarse correlated equilibria.
result DREAM achieves state-of-the-art performance in benchmark games and is competitive with simulator-based algorithms.

DREAM model improves computational efficiency for non-linear effects in relational event models.

problem Efficiently modeling non-linear effects in dynamic relational networks.
method Introduces Deep Relational Event Additive Model (DREAM) using Neural Additive Models.
result Demonstrates superior computational efficiency compared to traditional REM approaches.

Learning to control robots directly based on images is a primary challenge in robotics. However, many existing reinforcement learning approaches require iteratively obtaining millions of robot samples to learn a policy, which can take significant time. In this paper, we focus on learning a realistic world model capturi…

2018-05-20abs ↗pdf ↗

Model compression is eminently suited for deploying deep learning on IoT-devices. However, existing model compression techniques rely on access to the original or some alternate dataset. In this paper, we address the model compression problem when no real data is available, e.g., when data is private. To this end, we p…

2019-05-17abs ↗pdf ↗

ESCHER avoids importance sampling to estimate regret in large games.

problem Estimating Nash equilibria in large games with high variance.
method Computes a history value function to estimate regret without importance sampling.
result ESCHER reduces regret estimation variance significantly compared to existing methods.

Study shows non-polyhedral structure in moduli spaces for n≥8.

problem Identifying non-polyhedral structure in moduli spaces of pointed stable curves.
method Constructing an extremal non-polyhedral ray via maps on meromorphic strata of differentials.
result Moduli spaces are not Mori Dream Spaces for n≥8.

Machine learning models learn what we teach them to learn. Machine learning is at the heart of recommender systems. If a machine learning model is trained on biased data, the resulting recommender system may reflect the biases in its recommendations. Biases arise at different stages in a recommender system, from existi…

2019-05-10abs ↗pdf ↗

In this paper, we introduce playing games on shadows of knots. We demonstrate two novel games, namely, To Knot or Not to Knot and Much Ado about Knotting. We also discuss winning strategies for these games on certain families of knot shadows. Finally, we suggest variations of these games for further study.

2010-03-23abs ↗pdf ↗

We show that any bounded zero-angular momentum solution for the Newtonian three-body problem must suffer infinitely many eclipses, or collinearities, provided that it does not suffer a triple collision. Motivation for the result comes from the dream of building a symbolic dynamics for the three-body problem, one whose …

2001-10-26abs ↗pdf ↗

A neural network learns from examples and optimizes by dreaming.

problem The gap between training data and biological neural networks' experience.
method Inspired by biological learning, a generalized Hopfield network with Hebbian learning and off-line sleeping mechanisms.
result The network learns from examples, generalizes, and optimizes its storage capacity.

Dimofte, Gaiotto and Gukov introduced a powerful invariant, the 3D-index, associated to a suitable ideal triangulation of a 3-manifold with torus boundary components. The 3D-index is a collection of formal power series in q1/2q^{1/2} with integer coefficients. Our goal is to explain how the 3D-index is a generating serie…

2016-04-10abs ↗pdf ↗

We explore building generative neural network models of popular reinforcement learning environments. Our world model can be trained quickly in an unsupervised manner to learn a compressed spatial and temporal representation of the environment. By using features extracted from the world model as inputs to an agent, we c…

2018-03-27abs ↗pdf ↗

We consider projective rational strong Calabi dream surfaces: projective smooth rational surfaces which admit a constant scalar curvature Kähler metric for every Kähler class. We show that there are only two such rational surfaces, namely the projective plane and the quadric surface. In particular, we show that all rat…

2017-12-13abs ↗pdf ↗

We propose generative neural network methods to generate DNA sequences and tune them to have desired properties. We present three approaches: creating synthetic DNA sequences using a generative adversarial network; a DNA-based variant of the activation maximization ("deep dream") design method; and a joint procedure wh…

2017-12-17abs ↗pdf ↗

Survey on quantum computing and neural networks.

problem Understanding and comparing quantum computing and neural networks.
method Introduction to quantum computing concepts, explanation of quantum computing paradigms, and analysis of quantum neural networks.
result Current state-of-the-art in quantum neural networks.

We discuss a recurrent geometrical method, due to Élie Cartan and von Weber ([1],[11]) enabling us to determine, step by step, the maximal integral manifolds of a not necessarily integrable nor regular Pfaffian system. The dimensions of such integral manifolds can, of course, vary from point to point but more so can va…

2016-08-09abs ↗pdf ↗

LLMs can be tricked into recalling facts based on context clues.

problem Manipulation of LLMs' factual recall through context changes.
method Mathematical exploration of transformers' associative memory properties.
result Transformers use self-attention and value matrix for associative memory.

New sampler tackles complex discrete energy landscapes efficiently.

problem Stagnation in gradient-based discrete samplers for non-convex settings.
method DREXEL sampler with Replica Exchange and Adjusted Metropolis.
result Proves samplers satisfy detailed balance and converge to target distribution.

Expands experimental design for causal discovery from limited data.

problem Challenges in causal discovery from observational and interventional data.
method Bayesian optimal experimental design incorporating recent advances in causal discovery.
result Active causal discovery of large, nonlinear SCMs with both intervention target and value selection.

Motivation: Modelling methods that find structure in data are necessary with the current large volumes of genomic data, and there have been various efforts to find subsets of genes exhibiting consistent patterns over subsets of treatments. These biclustering techniques have focused on one data source, often gene expres…

2015-12-29abs ↗pdf ↗

Develops a nonparametric graphical model for conditional independence.

problem Evaluation of conditional independence without distributional assumptions.
method Nonlinear sufficient dimension reduction techniques applied to a nonparametric graphical model.
result Method outperforms existing methods in non-Gaussian settings and high-dimensional data.

We introduce DeepInversion, a new method for synthesizing images from the image distribution used to train a deep neural network. We 'invert' a trained network (teacher) to synthesize class-conditional input images starting from random noise, without using any additional information about the training dataset. Keeping …

2019-12-18abs ↗pdf ↗

In this paper we provide an explicit formula for the optimal lower bound of Donaldson's J-functional, in the sense of finding explicitly the optimal constant in the definition of coercivity, which always exists and takes negative values in general. This constant is positive precisely if the J-equation admits a solution…

2019-07-02abs ↗pdf ↗

Advances in neural network based classifiers have transformed automatic feature learning from a pipe dream of stronger AI to a routine and expected property of practical systems. Since the emergence of AlexNet every winning submission of the ImageNet challenge has employed end-to-end representation learning, and due to…

2017-03-07abs ↗pdf ↗

The vast majority of current machine learning algorithms are designed to predict single responses or a vector of responses, yet many types of response are more naturally organized as matrices or higher-order tensor objects where characteristics are shared across modes. We present a new machine learning algorithm BaTFLE…

2016-12-09abs ↗pdf ↗

LLMs can simulate human investment attitudes based on personality traits.

problem Investigating how LLMs mimic human investment behaviors.
method Simulated investment task using LLM personas with specific Big Five personality profiles.
result LLMs can produce meaningful behavioural differences in investment tasks that align with human traits.

While the costs of human violence have attracted a great deal of attention from the research community, the effects of the network-on-network (NoN) violence popularised by Generative Adversarial Networks have yet to be addressed. In this work, we quantify the financial, social, spiritual, cultural, grammatical and derm…

2017-03-07abs ↗pdf ↗

Wilson-loop averages in Chern-Simons theory (HOMFLY polynomials) can be evaluated in different ways -- the most difficult, but most interesting of them is the hypercube calculus, the only one applicable to virtual knots and used also for categorification (higher-dimensional extension) of the theory. We continue the stu…

2015-06-24abs ↗pdf ↗

New method identifies precursors of financial crises in market correlation structures.

problem Predicting long-term financial crises in non-Markovian, non-stationary markets.
method Identifying quasi-stationary market states and their precursor properties.
result Certain features of market states show potential as indicators of financial crises.

Study reveals widespread manipulation of meme coins, leading to significant economic losses.

problem Widespread manipulation of meme coins leading to economic losses.
method Cross-chain analysis of 34,988 tokens across Ethereum, BNB Smart Chain, Solana, and Base.
result 82.8% of high-return tokens show evidence of artificial growth strategies.

The paper reveals the hidden costs of digitizing commodity money and proposes a new stable-coin system.

problem Depreciation of banknotes due to high logistics costs after digitization.
method Analyzing the functions of money from a logistics perspective and comparing commodity money to digital currency.
result There is no honest money that is both a store of value and has negligible logistics costs.