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

Trend · papers per month

56113169225 · Jun 202019922001200920172026
48 results for unnoticed variables

Current economic theories miss most of economic dynamics.

problem Accuracy of economic theories and policies depend on economic variables and processes.
method Identify and analyze overlooked economic variables and processes.
result Many economic variables and processes not accounted for in current theories.

AI systems that explain their decisions can be monitored for harmful intentions.

problem Monitoring AI systems' decision-making processes for harmful intentions is imperfect and can miss some misbehavior.
method Monitoring the chain of thought (CoT) of AI systems that communicate in human language.
result CoT monitoring is a promising but fragile approach to AI safety.

IUPM monitors machine learning models under gradual shifts using optimal transport and active labeling.

problem Gradual distribution shifts lead to unnoticed accuracy declines in machine learning models.
method Incremental Uncertainty-aware Performance Monitoring (IUPM) using optimal transport and active labeling.
result IUPM outperforms existing baselines in gradual shift scenarios and guides label acquisition more effectively.

We present a supervised-learning algorithm from graph data (a set of graphs) for arbitrary twice-differentiable loss functions and sparse linear models over all possible subgraph features. To date, it has been shown that under all possible subgraph features, several types of sparse learning, such as Adaboost, LPBoost, …

2014-03-20abs ↗pdf ↗

NUTS mixing time scales as d^(1/4) for Gaussian distributions.

problem Improving the efficiency of the No-U-Turn Sampler (NUTS) for Gaussian distributions.
method Coupling argument leveraging geometric structure of Gaussian concentration, uniformity analysis of NUTS transitions.
result The mixing time of NUTS scales as d^(1/4) for Gaussian distributions, up to logarithmic factors.

Network operators are generally aware of common attack vectors that they defend against. For most networks the vast majority of traffic is legitimate. However new attack vectors are continually designed and attempted by bad actors which bypass detection and go unnoticed due to low volume. One strategy for finding such …

2019-04-02abs ↗pdf ↗

The state price density of a basket, even under uncorrelated Black-Scholes dynamics, does not allow for a closed from density. (This may be rephrased as statement on the sum of lognormals and is especially annoying for such are used most frequently in Financial and Actuarial Mathematics.) In this note we discuss short …

2013-06-12abs ↗pdf ↗

Sales data in a commodity market (supermarket sales to consumers) has been analysed by studying the fluctuation spectrum and noise correlations. Three related products (ketchup, mayonnaise and curry sauce) have been analysed. Most noise in sales is caused by promotions, but here we focus on the fluctuations in baseline…

2004-12-07abs ↗pdf ↗

Researchers explore valuations on polyhedra and topological arrangements without imposing algebraic structures.

problem Understanding valuations on polyhedra and their connections to topological arrangements.
method Generalizes the setting of valuations on convex polyhedra to collections of defining hyperplanes without imposing algebraic structures.
result Uncovered a close relationship between scissors congruence problems and finite hyperplane arrangements.

In knot concordance three genera arise naturally, g(K), g_4(K), and g_c(K): these are the classical genus, the 4-ball genus, and the concordance genus, defined to be the minimum genus among all knots concordant to K. Clearly 0 <= g_4(K) <= g_c(K) <= g(K). Casson and Nakanishi gave examples to show that g_4(K) need not …

2001-07-19abs ↗pdf ↗

SPECTRE defends against backdoor attacks by amplifying corrupted data's spectral signature.

problem Backdoor attacks that change model behavior with specific triggers.
method Robust covariance estimation to amplify spectral signature of poisoned data.
result Clean model is completely removed from backdoor, even in hard-to-detect cases.

The paper explores symplectic connections on homogeneous spaces, finding a unique invariant connection.

problem Existence and uniqueness of symplectic connections on symplectic reductive homogeneous spaces.
method Introduced a family of invariant connections and showed the existence of a unique symplectic connection.
result Found a unique symplectic connection ablas abla^\mathbf{s} corresponding to a=b=frac13a=b= frac{1}{3}, which is Ricci-parallel.

The paper shows how ignoring temporal context in recommender systems evaluation leads to false confidence, proposing a method to embed temporal context.

problem The discrepancy between offline and online recommender system performance evaluation.
method Proposes a training procedure to embed temporal context into recommender systems and validates its advantage using multi-objective optimization.
result Including temporal context in recommender systems evaluation can improve recall@20 by up to 20%.

This work studies the statistical performance of Sinkhorn iterations in estimating Schrödinger bridges.

problem Estimating Schrödinger bridges with limited samples.
method Intermediate Sinkhorn iterations applied to the time-dependent drifts of SDEs.
result Established a statistical bound on the squared total variation error of Sinkhorn bridge iterations.

In the noisy tensor completion problem we observe mm entries (whose location is chosen uniformly at random) from an unknown n1×n2×n3n_1 \times n_2 \times n_3 tensor TT. We assume that TT is entry-wise close to being rank rr. Our goal is to fill in its missing entries using as few observations as possible. Let $n = \max(n…

2015-01-26abs ↗pdf ↗

Graph auto-encoders improve financial clustering using news and stock data.

problem Improving clustering of financial entities using multiple data sources.
method Applying graph deep learning to a finance graph with news co-occurrence and stock price data.
result Dual data sources (news and stock price) improve clustering purity to 64% compared to 32% and 42% for single data sources.

This work uncovers how model and data biases interact to cause unfairness in fraud detection.

problem Unfairness in fraud detection algorithms due to model and data biases.
method Taxonomy of data bias, hypotheses on fairness-accuracy trade-offs, real-world fraud use case study.
result Data bias affects fairness in expected value and variance, and simple pre-processing can balance group-wise error rates.

Bayesian inference reconstructs external potentials in DFT for many-particle systems.

problem Reconstructing external potentials in classical density-functional theory (DFT) for many-particle systems.
method Combines Bayesian inference with classical DFT to probabilistically reconstruct external potentials.
result Accurately infers external potentials and density profiles with uncertainty quantification.

VC-PCR improves prediction by clustering correlated variables.

problem Decreased prediction accuracy due to cluster structure in predictor variables.
method Supervised variable selection and clustering to integrate cluster information into a sparse modeling process.
result VC-PCR achieves better prediction, variable selection, and clustering performance.

In this paper, we propose multi-variable LSTM capable of accurate forecasting and variable importance interpretation for time series with exogenous variables. Current attention mechanism in recurrent neural networks mostly focuses on the temporal aspect of data and falls short of characterizing variable importance. To …

2018-06-17abs ↗pdf ↗

A neural network finds causal relationships among latent variables.

problem Learning causal structure among latent variables in high-dimensional data.
method Redundant Input Neural Network (RINN) with modified architecture and regularized objective function.
result The RINN method successfully recovers latent causal structure between input and output variables.

Derives derivatives and geometric framework for functions with non-independent variables.

problem Characterizing functions with non-independent variables in probabilistic models.
method Derives actual and dependent partial derivatives, dependent Jacobian matrix, and tensor metric.
result Derives gradient, Hessian, and Taylor expansion for functions with non-independent variables.

A new distance for mixed-variable, hierarchical datasets with meta variables.

problem Heterogeneous datasets limit generalizability and performance in machine learning and optimization.
method Developed a modeling framework for mixed-variable and hierarchical domains with meta variables, and a novel distance function.
result The novel distance function allows comparison of heterogeneous datasets, improving model performance.

Unified Bayesian Optimisation for mixed variables improves performance.

problem Efficient optimisation of problems with both categorical and continuous variables.
method Derive value proposals from the Expected Improvement criterion to optimise both categorical and continuous variables under a single acquisition metric.
result Unified approach significantly outperforms existing methods across mixed-variable tasks.

A method to assess variable importance in complex predictive models.

problem Assessing the importance of variables in complex predictive models.
method Assigning relevance measures to each variable by comparing predictions with a ghost variable and analyzing joint effects.
result The method provides insights into variable importance and joint effects not available with other methods.

Random Forest variable importance is improved by class balancing techniques.

problem Class imbalance problem in machine learning.
method Proposed a variable selection algorithm using RF variable importance and its confidence interval.
result Our algorithm efficiently selects an optimal feature set, leading to improved prediction performance.

Knoop enhances variable selection with over-parameterization and knockoffs.

problem Challenges of variable selection in high-dimensional datasets.
method Generates knockoff variables, integrates them into an over-parameterized model, and uses anomaly-based significance tests.
result Superior performance in variable selection compared to existing methods.

A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. Detecting hidden variables poses two problems: determining the relations to other variables in the model and determining the number of states of …

2013-01-10abs ↗pdf ↗

New method for fitting graphical models with latent variables using regularized conditional likelihood.

problem Graphical modeling with latent variables and confounding dependencies.
method Regularized conditional likelihood for exponential family graphical models.
result Framework applicable to broader settings without knowing latent variables' distribution.