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.
Investigates a Kyle model with imperfect information and risk aversion.
We propose a novel method for clustering data which is grounded in information-theoretic principles and requires no parametric assumptions. Previous attempts to use information theory to define clusters in an assumption-free way are based on maximizing mutual information between data and cluster labels. We demonstrate …
Causal inference from observational data requires assumptions. These assumptions range from measuring confounders to identifying instruments. Traditionally, causal inference assumptions have focused on estimation of effects for a single treatment. In this work, we construct techniques for estimation with multiple treat…
A family of probability distributions parametrized by an open domain in defines the Fisher information matrix on this domain which is positive semi-definite. In information geometry the standard assumption has been that the Fisher information matrix tensor is positive definite defining in this way a Riemannia…
Feature selection is one of the most fundamental problems in machine learning. An extensive body of work on information-theoretic feature selection exists which is based on maximizing mutual information between subsets of features and class labels. Practical methods are forced to rely on approximations due to the diffi…
Enhances robustness in experimental design through Generalised Bayesian inference.
In this short note we extend some of the recent results on matrix completion under the assumption that the columns of the matrix can be grouped (clustered) into subspaces (not necessarily disjoint or independent). This model deviates from the typical assumption prevalent in the literature dealing with compression and r…
Most existing works on disentangled representation learning are solely built upon an marginal independence assumption: all factors in disentangled representations should be statistically independent. This assumption is necessary but definitely not sufficient for the disentangled representations without additional induc…
The econophysics approach to socio-economic systems is based on the assumption of their complexity. Such assumption inevitably lead to another assumption, namely that underlying interconnections within socio-economic systems, particularly financial markets, are nonlinear, which is shown to be true even in mainstream ec…
Study finds adding more information to robust option pricing does not improve bounds.
We simplify information measure computation using learned features.
We examine a class of deep learning models with a tractable method to compute information-theoretic quantities. Our contributions are three-fold: (i) We show how entropies and mutual informations can be derived from heuristic statistical physics methods, under the assumption that weight matrices are independent and ort…
REALFIN benchmarks financial reasoning by removing implicit assumptions, revealing model weaknesses.
Framework sharpens causal effect estimates without external assumptions.
Neural estimator improves mutual information estimation in high dimensions.
The paper addresses bias in survival analysis due to informative censoring.
GALA framework learns invariant graph representations via environment augmentation with minimal assumptions.
Proposes an MTL method with clustering to improve regression accuracy.
Value-function approximation methods that operate in batch mode have foundational importance to reinforcement learning (RL). Finite sample guarantees for these methods often crucially rely on two types of assumptions: (1) mild distribution shift, and (2) representation conditions that are stronger than realizability. H…
Two novel methods estimate multiple FDR directions for binary categorical responses.
A model for human-machine decision-making with private info and opacity.
QPE identifies causal effects without assuming mechanisms or noise.
Measuring information value in markets using covariance of price changes and order flow.
New approach for semi-supervised learning under covariate shifts.
New model of vague knowledge without strict partitions or transitivity.
Model financial markets using information theory with a single parameter.
Study on optimal trading in a finite population with market frictions and asymmetric information.
We consider a reinforcement learning (RL) setting in which the agent interacts with a sequence of episodic MDPs. At the start of each episode the agent has access to some side-information or context that determines the dynamics of the MDP for that episode. Our setting is motivated by applications in healthcare where ba…
Information Geometric Causal Inference (IGCI) is a new approach to distinguish between cause and effect for two variables. It is based on an independence assumption between input distribution and causal mechanism that can be phrased in terms of orthogonality in information space. We describe two intuitive reinterpretat…
It has often been taken as a working assumption that directed links in information networks are frequently formed by "short-cutting" a two-step path between the source and the destination -- a kind of implicit "link copying" analogous to the process of triadic closure in social networks. Despite the role of this assump…
This paper introduces PM and PMLP to enhance SSL by considering probability density and cluster assumptions.
We consider the problems of clustering, classification, and visualization of high-dimensional data when no straightforward Euclidean representation exists. Typically, these tasks are performed by first reducing the high-dimensional data to some lower dimensional Euclidean space, as many manifold learning methods have b…
Sparse GEMINI selects relevant features for clustering without assumptions.
New method extracts factors of variation from data without much supervision.
We discuss the finding that cross-sectional characteristic based models have yielded portfolios with higher excess monthly returns but lower risk than their arbitrage pricing theory counterparts in an analysis of equity returns of stocks listed on the JSE. Under the assumption of general no-arbitrage conditions, we arg…
The estimation of an f-divergence between two probability distributions based on samples is a fundamental problem in statistics and machine learning. Most works study this problem under very weak assumptions, in which case it is provably hard. We consider the case of stronger structural assumptions that are commonly sa…
We study contextual bandit learning with an abstract policy class and continuous action space. We obtain two qualitatively different regret bounds: one competes with a smoothed version of the policy class under no continuity assumptions, while the other requires standard Lipschitz assumptions. Both bounds exhibit data-…
Source separation problems are ubiquitous in the physical sciences; any situation where signals are superimposed calls for source separation to estimate the original signals. In this tutorial I will discuss the Bayesian approach to the source separation problem. This approach has a specific advantage in that it require…
Proposes a robust VIB approach using soft labels and mutual info estimation.
The choice of sentence encoder architecture reflects assumptions about how a sentence's meaning is composed from its constituent words. We examine the contribution of these architectures by holding them randomly initialised and fixed, effectively treating them as as hand-crafted language priors, and evaluating the resu…
Before the massive spread of computer technology, information was far from complex. The development of technology shifted the paradigm: from individuals who faced scarce and costly information to individuals who face massive amounts of information accessible at low costs. Nowadays we are living in the era of big data a…
New method improves deep neural network performance in regression tasks.
The performance of most the clustering methods hinges on the used pairwise affinity, which is usually denoted by a similarity matrix. However, the pairwise similarity is notoriously known for its vulnerability of noise contamination or the imbalance in samples or features, and thus hinders accurate clustering. To tackl…
The paper establishes bounds for transductive learning using information theory.
While generative models such as Latent Dirichlet Allocation (LDA) have proven fruitful in topic modeling, they often require detailed assumptions and careful specification of hyperparameters. Such model complexity issues only compound when trying to generalize generative models to incorporate human input. We introduce …
This paper tightens information-theoretic bounds on generalization errors.
New model for disability insurance reserving handles delays in claim information.
Algorithm learns Bayesian network structure efficiently from data.