Dreaming model enables robots to learn policies from images.
problem Learning to control robots based on images is challenging.
method Learning a future representation/scene regressor conditioned on robot actions.
result Dreaming model enables policy learning that transfers to real-world.
Dream Distillation compresses models without data, achieving high accuracy.
problem Model compression without real data.
method Data-independent model compression framework.
result Achieves 88.5% accuracy on CIFAR-10 test set.
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.
LiDER refreshes past experiences in RL by dreaming about them.
problem Improving data efficiency in off-policy RL algorithms.
method Refreshing past experiences in a replay buffer using the current policy.
result LiDER consistently improves performance in Atari games.
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.
Reduces symplectic Hamiltonian systems to contact systems, realizing Poincaré's dream.
problem Scaling symmetries in Hamiltonian systems.
method Contact reduction of symplectic Hamiltonian systems.
result Generically possible reduction to contact Hamiltonian systems, reducing inputs needed.
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.
RL research overhypes potential but lacks deployable solutions.
problem Current RL research overhypes potential and lacks deployable solutions.
method Identifies and critiques current RL research practices.
result Current RL research direction is unlikely to lead to practical, economically viable solutions.
New meta-RL method avoids exploration-exploitation trade-off.
problem Learning to explore and exploit simultaneously in meta-RL.
method Developed new objectives for exploration and exploitation.
result DREAM outperforms existing methods on complex tasks.
Machine learning biases in job recommendations can lead to unfair outcomes.
problem Biased recommendations from recommender systems in job matching.
method Addressing biases at various stages of recommender systems training and deployment.
result Techniques can reduce bias in job recommendations, ensuring fair outcomes.
New Dreamer model tackles object vanishing in robot learning.
problem Object vanishing in Dreamer's latent state-space models.
method Decoder-free approach with InfoMax objective and data augmentation.
result Dreaming achieves best scores on 5 difficult robotics tasks.
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.
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…
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 …
Enhances financial market reinforcement learning with new state generation.
problem Improving reinforcement learning models for financial markets.
method Lipschitz extensions and artificial state generation.
result Improved investment strategy through enriched state space.
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.
Reductive quotients preserve klt singularities in algebraic geometry.
problem Preserving klt singularities in quotients of klt singularities.
method Proving that the quotient of a klt type singularity by a reductive group is of klt type.
result The quotient of a klt variety by a reductive group results in a klt variety with a suitable boundary.
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…
Paper finds explicit optimal lower bound for J-functional in Kähler geometry.
problem Finding optimal lower bounds for Donaldson's J-functional in Kähler geometry.
method Provided an explicit formula for the optimal lower bound of Donaldson's J-functional.
result Explicit formula for the optimal lower bound of Donaldson's J-functional, leading to new existence criteria for cscK metrics.
Develops a method to estimate optimal policy value in online learning.
problem Challenges in evaluating ongoing policies in online learning environments.
method Doubly Robust Interval Estimation (DREAM) method.
result Valid inference on online conditional mean estimator with asymptotically normal distribution.
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/2 with integer coefficients. Our goal is to explain how the 3D-index is a generating serie…
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.
Dreaming neural networks learn and consolidate patterns during sleep.
problem Maximizing information storage and critical capacity in neural networks.
method Daily routine of learning during awake state and consolidation during sleep, using Guerra's interpolation techniques.
result The network achieves perfect retrieval regime after sleep, storing the same number of patterns as neurons.
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…
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.
Paper uses diffusion models to design electric aircraft quickly.
problem Designing electric aircraft efficiently and accurately.
method Simulation-based inference with hierarchical diffusion models.
result Rediscovers known aircraft design trends and laws.
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.
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.
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…
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…
The hippocampal network approximates future locations using Nyström kernel approximations.
problem Learning neural representations for future locations under transition distributions.
method Formally derived neural network based on Nyström kernel approximations.
result The network successfully approximates transition distributions and yields sparse, localized receptive fields.
Synthesizes AI and human creativity for more compelling art.
problem Making AI-generated art more human-like.
method Combining Deep Learning and Cognitive Psychology theories.
result Demonstrates how AI can incorporate human creativity theories.
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…
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…
Study finds Jamal Khashoggi's murder negatively impacts Saudi Arabia's economy.
problem Investment deterrence due to Jamal Khashoggi's murder.
method Event-study methodology and asset pricing model.
result Khashoggi's murder had a severe adverse impact on banks, financial services, and materials sectors.
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…
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.
A new inference method using regression and batched discrepancies.
problem Simulating parameters from simulator outputs.
method Regression-based projection and batched discrepancy weighting.
result Method produces a self-normalized pseudo-posterior.
Automatic classification of trees using remotely sensed data has been a dream of many scientists and land use managers. Recently, Unmanned aerial vehicles (UAV) has been expected to be an easy-to-use, cost-effective tool for remote sensing of forests, and deep learning has attracted attention for its ability concerning…
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…
Wavelet scattering predicts material properties beyond training data.
problem Predict material properties beyond training data.
method Atomic orbital wavelet scattering transform.
result Extrapolation of material properties achieved.
DeepInversion generates images from trained networks without additional data.
problem Generating images from trained networks without real data.
method Inverting a trained network to synthesize images from random noise, optimizing using batch normalization layers and maximizing Jensen-Shannon divergence.
result Synthesized images from CIFAR-10 and ImageNet datasets show high fidelity and realism.
Paper develops real-time through-wall human pose imaging using RF signals.
problem Developing real-time vision through opaque objects.
method Many-to-Many Encoder/Decoder Paradigm, student/teacher learning, Residual CNN, RPN, LSTM.
result Accurately predicts human pose through visual occlusion using RF signals.
Bayesian approach infers signaling pathways from data.
problem Accurately understand cellular regulation processes.
method Dynamic Bayesian Network structure estimation using Markov Chain Monte Carlo.
result Efficient sampling of sparse graphs improves inference.
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.
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.