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

Trend · papers per month

80161241321 · Jun 202019922001200920172026
48 results for expressivity assumptions

Most network-based protein (or gene) function prediction methods are based on the assumption that the labels of two adjacent proteins in the network are likely to be the same. However, assuming the pairwise relationship between proteins or genes is not complete, the information a group of genes that show very similar p…

2012-12-03abs ↗pdf ↗

The paper explores learning good policies from past data in large state spaces.

problem Learning good policies from historical data in large state spaces.
method Introduces expressivity assumptions and data coverage for function approximation and algorithmic design.
result A variety of algorithms and their guarantees are presented based on assumptions and desired complexity.

Tree-based regularization improves latent variable inference from related datasets.

problem Inferring latent variables from multiple related datasets in causal systems.
method Tree-Based Regularization (TBR) for sparse changes across environments.
result TBR identifies true latent variables up to simple transformations under sparse changes.

This work explores the relationship between expressivity and generalization in GNNs.

problem Understanding the trade-off between expressivity and generalization in GNNs.
method Introducing a novel framework that connects GNN generalization to the variance in graph structures they can capture.
result Theoretical findings align with empirical results, offering a deeper understanding of how expressivity enhances GNN generalization.

We consider large-scale studies in which it is of interest to test a very large number of hypotheses, and then to estimate the effect sizes corresponding to the rejected hypotheses. For instance, this setting arises in the analysis of gene expression or DNA sequencing data. However, naive estimates of the effect sizes …

2014-05-16abs ↗pdf ↗

In this paper we explore the functional correlation approach to operational risk. We consider networks with heterogeneous a-priori conditional and unconditional failure probability. In the limit of sparse connectivity, self-consistent expressions for the dynamical evolution of order parameters are obtained. Under equil…

2006-09-14abs ↗pdf ↗

Causal models communicate our assumptions about causes and effects in real-world phe- nomena. Often the interest lies in the identification of the effect of an action which means deriving an expression from the observed probability distribution for the interventional distribution resulting from the action. In many case…

2018-06-19abs ↗pdf ↗

New research challenges the independence assumption in neurosymbolic learning, leading to overconfident predictions and unrepresentable uncertainty.

problem The independence assumption in neurosymbolic learning systems can lead to overconfident predictions and hinder uncertainty quantification.
method The study proves the limitations of the independence assumption and introduces new loss functions that are non-convex and difficult to optimise.
result Neurosymbolic learning systems using the independence assumption are prone to overconfidence and cannot represent uncertainty over multiple valid options.

I show that the solution of a standard clearing model commonly used in contagion analyses for financial systems can be expressed as a specific form of a generalized Katz centrality measure under conditions that correspond to a system-wide shock. This result provides a formal explanation for earlier empirical results wh…

2017-06-01abs ↗pdf ↗

Bounds on factual and counterfactual distributions under measurement error in discrete models.

problem Measurement errors in discrete data and their impact on inference.
method Expressing modeling assumptions as linear constraints and using linear programming to derive bounds.
result Sharp bounds on factual and counterfactual distributions for various models, including instrumental variable scenarios.

We derive a new Bayesian Information Criterion (BIC) by formulating the problem of estimating the number of clusters in an observed data set as maximization of the posterior probability of the candidate models. Given that some mild assumptions are satisfied, we provide a general BIC expression for a broad class of data…

2017-10-22abs ↗pdf ↗

DeepMartingale uses deep learning to solve complex optimal stopping problems efficiently.

problem Optimal stopping problems in high-dimensional continuous-time models.
method Leverages martingale representation and deep learning to directly optimize over parameterized martingales.
result DeepMartingale can approximate the true value function to any desired accuracy with neural networks of manageable size.

Wang and Yau [10] introduced a quasi-local mass, which is a hyperbolic background generalization of Liu-Yau's expression [7] [8], and proved its positivity. In this note, we prove that the positivity of this quasi-local mass is still valid under weaker assumptions on the boundary hypersurface in general dimensions. The…

2013-06-24abs ↗pdf ↗

The classical Brody's theorem asserts the equivalence between two notions of hyperbolicity for compact complex spaces, one named after Kobayashi and one expressed in terms of lack of non constant holomorphic entire functions (compactness is only used to prove the harder implication). We extend this theorem to Deligne-M…

2012-01-12abs ↗pdf ↗

Researchers infer gene activity in dividing cells, accounting for protein inheritance and division history.

problem Inferring protein production kinetics in dividing cells due to protein inheritance and division history.
method Adapted conditional normalizing flows to approximate intractable likelihoods from simulated data.
result Glc3 gene is mostly inactive under stress, with brief and transient expression.

Develops European power option pricing under correlated interest rate and asset processes.

problem Pricing European power options under correlated interest rate and asset processes.
method Martingale method and Girsannov transform.
result Derives European power option pricing formulae under two market assumptions.

Proposes methods to estimate posterior probability and propensity score functions without assuming constant propensity score.

problem Learning from biased positive-unlabeled data.
method Parametric approach to joint estimation of posterior probability and propensity score functions using maximum likelihood and alternating maximization.
result Proposed methods are comparable or better than existing methods based on Expectation-Maximisation scheme.

In many application areas---lending, education, and online recommenders, for example---fairness and equity concerns emerge when a machine learning system interacts with a dynamically changing environment to produce both immediate and long-term effects for individuals and demographic groups. We discuss causal directed a…

2019-09-18abs ↗pdf ↗

We continue our study, initiated in an earlier article, of a class of rigid hypersurfaces in C3{\mathbb C}^3 that are 2-nondegenerate and uniformly Levi degenerate of rank 1, having zero CR-curvature. We drop the restrictive assumptions of the earlier paper and give a complete description of the class. Surprisingly, th…

2019-01-10abs ↗pdf ↗

The paper derives market-based correlations between asset prices and returns.

problem Market assumptions of constant trade volumes and past values are inaccurate.
method Derives expressions of correlations based on statistical moments and trade volumes.
result Market-based correlations are essential for traders, banks, and funds.

Residual networks (ResNets) are a deep learning architecture that substantially improved the state of the art performance in certain supervised learning tasks. Since then, they have received continuously growing attention. ResNets have a recursive structure xk+1=xk+Rk(xk)x_{k+1} = x_k + R_k(x_k) where RkR_k is a neural network cal…

2019-10-21abs ↗pdf ↗

New method improves combinatorial optimization by capturing dependencies among solution variables.

problem Performance limitations in solving combinatorial optimization problems using independent solution variables.
method Subgraph tokenization and variational annealing to capture dependencies and improve learning efficiency.
result Empirical evidence shows superior performance of autoregressive methods with tokenization and annealed entropy regularization.

Paper solves investment and consumption problem with unknown risk, providing explicit solutions.

problem Solving consumption-investment problem with unknown market price of risk and terminal liability constraint.
method Introduced a coupled forward-backward stochastic differential equation (FBSDE) and provided an explicit solution.
result Explicit expressions for optimal investment strategy and value function derived.

We consider the problem of estimating high-dimensional Gaussian graphical models corresponding to a single set of variables under several distinct conditions. This problem is motivated by the task of recovering transcriptional regulatory networks on the basis of gene expression data {containing heterogeneous samples, s…

2013-03-21abs ↗pdf ↗

The paper examines the consistency of item embeddings in recommendation systems.

problem The relevance of averaging item embeddings for user or concept representation.
method Proposes an expected precision score to measure consistency and analyzes it theoretically and empirically.
result Real-world averages are less consistent for recommendation compared to theoretical assumptions.

Compression is at the heart of effective representation learning. However, lossy compression is typically achieved through simple parametric models like Gaussian noise to preserve analytic tractability, and the limitations this imposes on learning are largely unexplored. Further, the Gaussian prior assumptions in model…

2019-04-15abs ↗pdf ↗

Deep neural networks approximate analytic functions in high dimensions with exponential rates.

problem Approximating analytic functions in high-dimensional spaces using neural networks.
method Analyzing convergence rates of ReLU and ReLU^k activations in L2(Rd,γd)L^2(\mathbb{R}^d,γ_d) for dN{}d\in\mathbb{N}\cup\{\infty\}.
result Exponential convergence rates for analytic functions in L2(Rd,γd)L^2(\mathbb{R}^d,γ_d) for dNd\in\mathbb{N}, and dimension-independent bounds for d=d=\infty.

In high-dimensional linear models, the sparsity assumption is typically made, stating that most of the parameters are equal to zero. Under the sparsity assumption, estimation and, recently, inference have been well studied. However, in practice, sparsity assumption is not checkable and more importantly is often violate…

2016-10-07abs ↗pdf ↗

We solve the ANOVA decomposition for categorical inputs.

problem Lack of a closed-form expression for ANOVA decomposition with categorical dependent variables.
method Bridge functional analysis with discrete Fourier analysis to derive a closed-form decomposition.
result Closed-form decomposition for categorical inputs without assumptions.