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

57114171228 · Jun 202019922001200920172026
48 results for extraneous variables

Adaptive feature normalization improves model robustness to extraneous variables.

problem Degrading model performance due to extraneous variables in deep learning.
method Adaptive feature normalization using instance normalization instead of batch normalization.
result Adaptive normalization leads to significant performance gains across different datasets and architectures.

Both the median-based classifier and the quantile-based classifier are useful for discriminating high-dimensional data with heavy-tailed or skewed inputs. But these methods are restricted as they assign equal weight to each variable in an unregularized way. The ensemble quantile classifier is a more flexible regularize…

2019-10-28abs ↗pdf ↗

Paper introduces a method to generate stable shapes using Grassmann manifolds.

problem Generating stable shapes with minimal extraneous transformations.
method Continuous normalization flows on Grassmann manifolds to eliminate extraneous transformations.
result The method significantly outperforms state-of-the-art methods in generating high-quality samples.

Prompted by a recent experiment by Victor Haghani and Richard Dewey, this note generalises the Kelly strategy (optimal for simple investment games with log utility) to a large class of practical utility functions and including the effect of extraneous wealth. A counterintuitive result is proved : for any continuous, co…

2016-11-28abs ↗pdf ↗

We consider the problem of precision matrix estimation where, due to extraneous confounding of the underlying precision matrix, the data are independent but not identically distributed. While such confounding occurs in many scientific problems, our approach is inspired by recent neuroscientific research suggesting that…

2018-10-16abs ↗pdf ↗

Curating labeled training data has become the primary bottleneck in machine learning. Recent frameworks address this bottleneck with generative models to synthesize labels at scale from weak supervision sources. The generative model's dependency structure directly affects the quality of the estimated labels, but select…

2017-03-02abs ↗pdf ↗

Gaussian processes are rich distributions over functions, with generalization properties determined by a kernel function. When used for long-range extrapolation, predictions are particularly sensitive to the choice of kernel parameters. It is therefore critical to account for kernel uncertainty in our predictive distri…

2018-02-02abs ↗pdf ↗

A new method for generating replay samples on the fly, optimizing for not forgetting.

problem Addressing the issue of forgetting in neural networks.
method Generates auxiliary samples on the fly using the model's implicit memory, specialized to each real training batch.
result Optimizing for not forgetting leads to more efficient and scalable generation of specialized samples.

An asymmetric information model is introduced for the situation in which there is a small agent who is more susceptible to the flow of information in the market than the general market participant, and who tries to implement strategies based on the additional information. In this model market participants have access t…

2008-07-08abs ↗pdf ↗

Unified framework detects changes in complex system models.

problem Accurate identification of dynamic changes in simulation models.
method Combines machine learning and process-driven simulation modeling.
result Significantly improves change point detection accuracy.

Graph Convolutional Networks improve prosthetic sensation interpretation.

problem Improving neuroprosthetic performance and sensory information stability.
method Applied Graph Convolutional Networks (GCNs) to interpret neuronal spiking activity.
result GCN model achieved 73.5% performance on ordinal regression task.

Isometry regularizer improves autoencoder performance on manifold learning.

problem Bad generalization in autoencoders, especially extrinsic and intrinsic issues.
method Introduces an isometry regularizer that encourages the decoder to be an isometry and the encoder to be its pseudo-inverse.
result Isometry regularizer leads to better generalization and useful low-dimensional data representations.

The Gaussian curvature of a two-dimensional Riemannian manifold is uniquely determined by the choice of the metric. The formulas for computing the curvature in terms of components of the metric, in isothermal coordinates, involve the Laplacian operator and therefore, the problem of finding a Riemannian metric for a giv…

2004-06-17abs ↗pdf ↗

Method interprets deep learning models using topological data analysis.

problem Lack of interpretability in deep learning models, especially in high-risk applications.
method Topological and geometric data analysis to infer features and decision-making mechanisms of DL models.
result Extracted subgraphs reveal relevant features for model decisions, demonstrating model's reliance on pertinent data.

Estimates network structure from node potentials and edge flows under Gaussian injection statistics.

problem Estimating network structure from node potentials and edge flows under Gaussian injection statistics.
method Proposes an 1\ell_{1}-regularized maximum likelihood estimator for high-dimensional network structure estimation.
result Establishes sufficient conditions for exact sparsity recovery of network structure with high probability.

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.

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.

CIB compresses variables causally, preserving key causal interactions.

problem Constructing causal variable abstractions in complex systems.
method Causal Information Bottleneck (CIB) method, extending IB to include causal structures.
result CIB produces causally interpretable abstractions that accurately capture causal relations.

We generalize to the finite-state case the notion of the extreme effect variable YY that accumulates all the effect of a variant variable VV observed in changes of another variable XX. We conduct theoretical analysis and turn the problem of finding of an effect variable into a problem of a simultaneous decomposition…

2019-12-24abs ↗pdf ↗

Discond-VAE separates continuous and discrete factors in data.

problem Separating shared and class-specific variations in real-world data.
method Introduces private and public latent variables to represent continuous and discrete factors, respectively.
result Discond-VAE successfully disentangles class-dependent continuous factors from discrete factors.

A new method selects important variables for clustering from dependency networks.

problem Variable selection for clustering in high-cost data scenarios.
method Create dependency networks, rank variables by centrality, select top-n variables.
result Top-n variables improve clustering performance compared to existing methods.