arXiv research

Paper introduces scalable neural architecture for solving NP-hard problems.

FLOP algorithm speeds up causal structure learning for linear models.

Improved Markov models learn from their mistakes and adapt to problem complexity.

In this short note, we prove that the space of all admissible piecewise linear metrics parameterized by length square on a triangulated manifolds is a convex cone. We further study Regge's Einstein-Hilbert action and give a much more reasonable definition of discrete Einstein metric than our former version in \cite{G}.…

XLVINs improve deep reinforcement learning by combining self-supervised learning and neural algorithmic reasoning.

We describe a mathematical link between aspects of information theory, called pairwise comparisons, and discretized gauge theories. The link is made by the notion of holonomy along the edges of a simplex. This correspondance leads to open questions in both field.

Paper generalizes discrete uniformization for genus-zero surfaces.

Paper proves discrete uniformizations converge to continuous for surfaces of genus ≥1.

Generative Adversarial Networks (GAN) have limitations when the goal is to generate sequences of discrete elements. The reason for this is that samples from a distribution on discrete objects such as the multinomial are not differentiable with respect to the distribution parameters. This problem can be avoided by using…

New method learns disentangled discrete representations using categorical variational autoencoders.

Data discretization is an important step in the process of machine learning, since it is easier for classifiers to deal with discrete attributes rather than continuous attributes. Over the years, several methods of performing discretization such as Boolean Reasoning, Equal Frequency Binning, Entropy have been proposed,…

This work improves motion planning for quadcopters by learning and reasoning about controller performance.

NSR enables neural networks to reason with continuous numbers and extrapolate.

Discrete diffusion models improve data generation for discrete data like language and graphs.

Proposes DAM for optimizing discrete generative models.

This paper analyzes discrete diffusion models, deriving convergence bounds for their generated samples.

New model predicts energy prices under different scenarios.

Deep network predicts action sequences for complex tasks from a scene image.

Lossless compression methods shorten the expected representation size of data without loss of information, using a statistical model. Flow-based models are attractive in this setting because they admit exact likelihood optimization, which is equivalent to minimizing the expected number of bits per message. However, con…

There is a mismatch between the standard theoretical analyses of statistical machine learning and how learning is used in practice. The foundational assumption supporting the theory is that we can represent features and models using real-valued parameters. In practice, however, we do not use real numbers at any point d…

Deep neural networks with discrete latent variables offer the promise of better symbolic reasoning, and learning abstractions that are more useful to new tasks. There has been a surge in interest in discrete latent variable models, however, despite several recent improvements, the training of discrete latent variable m…

Graph based clustering is one of the major clustering methods. Most of it work in three separate steps: similarity graph construction, clustering label relaxing and label discretization with k-means. Such common practice has three disadvantages: 1) the predefined similarity graph is often fixed and may not be optimal f…

Training classification models on imbalanced data tends to result in bias towards the majority class. In this paper, we demonstrate how variable discretization and cost-sensitive logistic regression help mitigate this bias on an imbalanced credit scoring dataset, and further show the application of the variable discret…

Paper tackles functional linear regression using spectral algorithms with discrete observations.

New method improves inference for discrete diffusion models, achieving better quality and efficiency.

The success of generative modeling in continuous domains has led to a surge of interest in generating discrete data such as molecules, source code, and graphs. However, construction histories for these discrete objects are typically not unique and so generative models must reason about intractably large spaces in order…

We consider the problem of estimating the transition rate matrix of a continuous-time Markov chain from a finite-duration realisation of this process. We approach this problem in an imprecise probabilistic framework, using a set of prior distributions on the unknown transition rate matrix. The resulting estimator is a …

This paper tackles Gromov's filling area conjecture using discrete graph theory.

Let $M$ be a cusped hyperbolic $3$-manifold, e.g. a knot complement. Thurston showed that the space of deformations of its fundamental group in $\mathrm {PGL}(2,\mathbf {C})$ (up to conjugation) is of complex dimension the number $ν$ of cusps near the hyperbolic representation. It seems natural to ask whether some …

A new method for efficiently estimating Shapley values in dataset valuation.

We consider discrete default intensity based and logit type reduced form models for conditional default probabilities for corporate loans where we develop simple closed form approximations to the maximum likelihood estimator (MLE) when the underlying covariates follow a stationary Gaussian process. In a practically rea…

In many fields observations are performed irregularly along time, due to either measurement limitations or lack of a constant immanent rate. While discrete-time Markov models (as Dynamic Bayesian Networks) introduce either inefficient computation or an information loss to reasoning about such processes, continuous-time…

wd1 improves reasoning in dLLMs by optimizing policies without policy ratios.

In this paper the multivariate fractional trading ansatz of money management from Ralph Vince (Portfolio Management Formulas: Mathematical Trading Methods for the Futures, Options, and Stock Markets, John Wiley & Sons, Inc., 1990) is discussed. In particular, we prove existence and uniqueness of an optimal f of the res…

Being able to reason in an environment with a large number of discrete actions is essential to bringing reinforcement learning to a larger class of problems. Recommender systems, industrial plants and language models are only some of the many real-world tasks involving large numbers of discrete actions for which curren…

Differentiable ABMs face challenges in inference and optimisation.

Many matching, tracking, sorting, and ranking problems require probabilistic reasoning about possible permutations, a set that grows factorially with dimension. Combinatorial optimization algorithms may enable efficient point estimation, but fully Bayesian inference poses a severe challenge in this high-dimensional, di…

The paper refines optimization algorithms using Lyapunov functions and differential equations.

Efficiently aggregating data from different sources is a challenging problem, particularly when samples from each source are distributed differently. These differences can be inherent to the inference task or present for other reasons: sensors in a sensor network may be placed far apart, affecting their individual meas…

We introduce the value iteration network (VIN): a fully differentiable neural network with a `planning module' embedded within. VINs can learn to plan, and are suitable for predicting outcomes that involve planning-based reasoning, such as policies for reinforcement learning. Key to our approach is a novel differentiab…

AlphaForgeBench evaluates LLMs as quantitative researchers, not trading agents, to address instability in financial decision-making.

Stochastic volatility models describe asset prices $S_t$ as driven by an unobserved process capturing the random dynamics of volatility $σ_t$. Here, we quantify how much information about $σ_t$ can be inferred from asset prices $S_t$ in terms of Shannon's mutual information $I(S_t : σ_t)$. This motivates a careful nume…

Spin-glasses are universal models that can capture complex behavior of many-body systems at the interface of statistical physics and computer science including discrete optimization, inference in graphical models, and automated reasoning. Computing the underlying structure and dynamics of such complex systems is extrem…

We consider as given a discrete time financial market with a risky asset and options written on that asset and determine both the sub- and super-hedging prices of an American option in the model independent framework of ArXiv:1305.6008. We obtain the duality of results for the sub- and super-hedging prices. For the sub…

Many studies have shown that there are good reasons to claim very low predictability of currency nevertheless, the deviations from true randomness exist which have potential predictive and prognostic power [J.James, Quantitative finance 3 (2003) C75-C77]. We analyze the local trends which are of the main focus of the t…

A new method for stochastic control based on neural networks and using randomisation of discrete random variables is proposed and applied to optimal stopping time problems. The method models directly the policy and does not need the derivation of a dynamic programming principle nor a backward stochastic differential eq…

A new type of quadrature is developed. The Gaussian quadrature, for a given measure, finds optimal values of a function's argument (nodes) and the corresponding weights. In contrast, the Lebesgue quadrature developed in this paper, finds optimal values of function (value-nodes) and the corresponding weights. The Gaussi…

This paper develops a novel methodology for using symbolic knowledge in deep learning. From first principles, we derive a semantic loss function that bridges between neural output vectors and logical constraints. This loss function captures how close the neural network is to satisfying the constraints on its output. An…