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,742 papers · 148 categories

Trend · papers per month

120240360480 · Jun 202019922001200920172026
48 results for Mori Dream Spaces

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.

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 ↗

Novel autoencoder method approximates Koopman operator in low dimensions.

problem Challenges in approximating finite Koopman operators using data-driven methods.
method Mori-Zwanzig autoencoder (MZ-AE) for robust Koopman operator approximation.
result Improved predictive capability and robust long-term statistical performance.

The authors give a complete classification of projective threefolds admitting a holomorphic normal projective connection. Moreover, they prove a general structure theorem on complex projective manifolds admitting a holomorphic normal projective connection, saying in particular, that any such manifold is either the proj…

2002-10-08abs ↗pdf ↗

In this paper we show that the Chern numbers of a smooth Mori fibre space in dimension three are bounded in terms of the underlying topological manifold. We also generalise a theorem of Cascini and the second named author on the boundedness of Chern numbers of certain threefolds to the case of negative Kodaira dimensio…

2019-06-04abs ↗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.

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 ↗

A new method predicts non-Markovian closure terms for complex systems.

problem Predicting the effect of unresolved variables on resolved dynamics in high-dimensional systems.
method Mamba-Assisted Closure (MAC) framework: sequence model trained to predict closure from resolved trajectory, coupled with reduced-order equations.
result Substantially outperforms existing methods in predictive accuracy and long-time stability.

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 ↗

Study optimal degenerations of Fano threefolds, proving K-polystability and Kähler-Ricci solitons.

problem Optimal degenerations of K-unstable Fano threefolds.
method Explicitly determined degenerations, finding weighted K-polystable (X0,ξ0)(\mathcal{X}_0, ξ_0), studying moduli spaces.
result One moduli space is isomorphic to the GIT-moduli space of biconic curves, the other is a single point.

iLED framework offers interpretable dynamics for multiscale systems.

problem Modeling high-dimensional multiscale systems is challenging.
method Interpretable Learning Effective Dynamics (iLED) framework based on Mori-Zwanzig and Koopman operator theory.
result Comparable accuracy to state-of-the-art approaches with added interpretability.

Given a (meromorphic) fibration f:XYf:X\to Y where XX and YY are compact complex manifolds of dimensions nn and mm, we define LfL_f to be the invertible subsheaf of the sheaf of holomorphic mm-forms of XX given by the saturation of fKYf^*K_Y, where KYK_Y is the canonical sheaf of YY. We define the Kodaira dimension…

2002-11-04abs ↗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 ↗

Develops a new geometric framework for quantum metrics.

problem Quantum metric generalization for pure two-qubit states.
method Support-projected Petz monotone geometry for pure two-qubit families.
result Strictly generalizes SLD/Bures case and includes other metrics.

By using analytic method, we prove that there exist rational curves on compact Hermitian manifolds with positive holomorphic bisectional curvature. It confirms a question of S.-T. Yau. It is well-known that Mori proved in \cite{Mori79} that every compact complex manifold NN with c1(N)>0c_1(N)>0 contains at least one ration…

2014-09-08abs ↗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 ↗