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.
CODE learns ODE dynamics from sparse data, outperforming neural and kernel methods.
This work proposes a meta-learning approach for better adaptation of source code models.
As the performance of computer systems stagnates due to the end of Moore's Law, there is a need for new models that can understand and optimize the execution of general purpose code. While there is a growing body of work on using Graph Neural Networks (GNNs) to learn representations of source code, these representation…
Symbolic dynamics for flows in high dimensions, extending previous work.
Sparse codes improve optimal control tasks with correlated inputs.
Motion Code models time series dynamics with sparse approximations.
Model infers latent variables in sparse coding models using Langevin dynamics.
Predictive Sparse Manifold Transform learns dynamic video sequences.
Online DEM improves tracking of latent states in dynamic systems.
Dynamical system models (including RNNs) often lack the ability to adapt the sequence generation or prediction to a given context, limiting their real-world application. In this paper we show that hierarchical multi-task dynamical systems (MTDSs) provide direct user control over sequence generation, via use of a latent…
A new approach predicts next observations without explicit decoding for better control.
Predictive coding networks are shown to be stable, robust, and converge faster than backpropagation.
Stable actions of hyperbolic groups on their boundaries.
WeldNet reduces complex dynamics to simpler, manageable segments.
While recent progress in deep reinforcement learning has enabled robots to learn complex behaviors, tasks with long horizons and sparse rewards remain an ongoing challenge. In this work, we propose an effective reward shaping method through predictive coding to tackle sparse reward problems. By learning predictive repr…
The need to efficiently calculate first- and higher-order derivatives of increasingly complex models expressed in Python has stressed or exceeded the capabilities of available tools. In this work, we explore techniques from the field of automatic differentiation (AD) that can give researchers expressive power, performa…
There is growing evidence regarding the importance of spike timing in neural information processing, with even a small number of spikes carrying information, but computational models lag significantly behind those for rate coding. Experimental evidence on neuronal behavior is consistent with the dynamical and state dep…
Researchers found the maximum number of holes in polyominoes grows proportionally to the dimension.
New model reveals balance crucial for robust neural coding.
Electronic medical record (EMR) data contains historical sequences of visits of patients, and each visit contains rich information, such as patient demographics, hospital utilisation and medical codes, including diagnosis, procedure and medication codes. Most existing EMR embedding methods capture visit-code associatio…
Tasks like code generation and semantic parsing require mapping unstructured (or partially structured) inputs to well-formed, executable outputs. We introduce abstract syntax networks, a modeling framework for these problems. The outputs are represented as abstract syntax trees (ASTs) and constructed by a decoder with …
Coding theory is a central discipline underpinning wireline and wireless modems that are the workhorses of the information age. Progress in coding theory is largely driven by individual human ingenuity with sporadic breakthroughs over the past century. In this paper we study whether it is possible to automate the disco…
This paper speeds up simulations of hypersonic reentry by combining traditional and neural methods.
Metalearning optimizes autoencoder dimensions for efficient data representation.
Programming languages are emerging as a challenging and interesting domain for machine learning. A core task, which has received significant attention in recent years, is building generative models of source code. However, to our knowledge, previous generative models have always been framed in terms of generating stati…
New algorithm reduces dynamic regret by adapting to comparator complexity.
Although deep learning has shown great success in recent years, researchers have discovered a critical flaw where small, imperceptible changes in the input to the system can drastically change the output classification. These attacks are exploitable in nearly all of the existing deep learning classification frameworks.…
New method finds 198,846 toric-colorable seeds of Picard number 5.
Proposes a novel neural architecture for sparse coding using learned greedy pursuit.
PRISM-VQ combines financial priors with vector quantization for better stock prediction.
Transformer models waste resources on long-context tasks.
There is a perceived trade-off between machine learning code that is easy to write, and machine learning code that is scalable or fast to execute. In machine learning, imperative style libraries like Autograd and PyTorch are easy to write, but suffer from high interpretive overhead and are not easily deployable in prod…
The quality of data representation in deep learning methods is directly related to the prior model imposed on the representations; however, generally used fixed priors are not capable of adjusting to the context in the data. To address this issue, we propose deep predictive coding networks, a hierarchical generative mo…
Spiking neural networks (SNNs) could play a key role in unsupervised machine learning applications, by virtue of strengths related to learning from the fine temporal structure of event-based signals. However, some spike-timing-related strengths of SNNs are hindered by the sensitivity of spike-timing-dependent plasticit…
Sparsity-based representations have recently led to notable results in various visual recognition tasks. In a separate line of research, Riemannian manifolds have been shown useful for dealing with features and models that do not lie in Euclidean spaces. With the aim of building a bridge between the two realms, we addr…
Encoding a sequence of observations is an essential task with many applications. The encoding can become highly efficient when the observations are generated by a dynamical system. A dynamical system imposes regularities on the observations that can be leveraged to achieve a more efficient code. We propose a method to …
Commonly used limit order book attributes are empirically considered based on NASDAQ ITCH data. It is shown that some of them have the properties drastically different from the ones assumed in many market dynamics study. Because of this difference we propose to make a transition from "Statistical" type of order book st…
In this paper, a neural network-aided bit-interleaved coded modulation (NN-BICM) receiver is designed to mitigate the nonlinear clipping distortion in the LDPC coded direct currentbiased optical orthogonal frequency division multiplexing (DCOOFDM) systems. Taking the cross-entropy as loss function, a feed forward netwo…
The study proves the uniqueness of entropy-maximizing measures for geodesic flows on specific manifolds.
New method learns population dynamics from snapshots using JKO scheme and inverse optimization.
FNSDA adapts to new dynamics via Fourier space adaptation.
The dynamic emulation of non-linear deterministic computer codes where the output is a time series, possibly multivariate, is examined. Such computer models simulate the evolution of some real-world phenomenon over time, for example models of the climate or the functioning of the human brain. The models we are interest…
ERFit identifies dynamic equations from data with minimal supervision.
DeepEDM forecasts time series by learning dynamics from embeddings.
QRAFTI uses multi-agent framework to improve equity factor research.
We are interested in the decomposition of motion data into a sparse linear combination of base functions which enable efficient data processing. We combine two prominent frameworks: dynamic time warping (DTW), which offers particularly successful pairwise motion data comparison, and sparse coding (SC), which enables an…
Interacting systems are prevalent in nature, from dynamical systems in physics to complex societal dynamics. The interplay of components can give rise to complex behavior, which can often be explained using a simple model of the system's constituent parts. In this work, we introduce the neural relational inference (NRI…
CoDA adapts dynamics models to new physical systems by conditioning on context.