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

Trend · papers per month

56113169225 · Jun 202019922001200920172026
48 results for arm-specific variables

The paper tackles misspecification in contextual bandits by incorporating arm-specific variables.

problem Misspecification in contextual bandits due to unexplained inter-arm heterogeneity.
method Develops robust contextual bandit algorithms (RoLinUCB and RoLinTS) that incorporate arm-specific variables to address misspecification.
result The developed algorithms bound the nn-round Bayes regret and show superior performance in various misspecification scenarios.

This work introduces CAET, an algorithm for cost-aware pairwise pure exploration.

problem Identifying optimal arm pairs with varying costs in multi-armed bandits.
method Introduces a framework for pairwise pure exploration with arm-specific costs, derives a lower bound, and proposes CAET algorithm.
result CAET optimizes cumulative cost and approaches the lower bound asymptotically.

Optimal algorithm for high-dimensional stochastic linear bandits with sparse parameters.

problem High-dimensional stochastic linear bandits with sparse parameters.
method Three-stage arm selection algorithm using thresholded Lasso for estimation.
result Achieves exact minimax optimality in cumulative regret.

Optimism stabilizes Thompson Sampling for adaptive inference in multi-armed bandits.

problem Subtle inferential properties of Thompson Sampling under adaptive data collection.
method Introduced optimism as a key mechanism to restore stability and validity of inference.
result Suitably implemented optimism stabilizes Thompson Sampling and enables asymptotically valid Wald inference.

Kernelized bandit algorithm tackles adaptive contextual bandits with single-index models.

problem Adaptive contextual bandits with single-index models and unknown link functions.
method Kernelized ε-greedy algorithm combining Stein-based index estimation and kernel ridge regression for reward functions.
result Unified framework for simultaneous learning and inference in single-index contextual bandits.

The paper develops algorithms to minimize misallocation and identify the arm with the highest variance.

problem Minimizing misallocation and identifying the arm with the highest variance from a set of arms.
method Developed novel online algorithms UCB-VV for misallocation minimization and SHVV for fixed budget best arm identification.
result The algorithms achieve optimal performance in terms of misallocation and error 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.

The paper introduces methods to identify key variables discriminating between two datasets.

problem Identifying variables that distinguish between two datasets.
method Introduces a mathematical notion of discriminating variables and proposes two methods for their selection.
result Proposed methods improve upon existing techniques in two-sample variable selection.

This work presents entropic constraints from DAGs with hidden variables.

problem Characterizing causal relations in systems with hidden variables.
method Entropic inequality constraints derived from ee-separation relations.
result These constraints can learn about true causal models from observed data.

For recurrent neural networks trained on time series with target and exogenous variables, in addition to accurate prediction, it is also desired to provide interpretable insights into the data. In this paper, we explore the structure of LSTM recurrent neural networks to learn variable-wise hidden states, with the aim t…

2019-05-28abs ↗pdf ↗

Proposes a two-stage method for selecting correlated predictors in high-dimensional data.

problem Selecting correlated predictors in high-dimensional data with unknown group structures.
method Two-stage approach: variable clustering followed by group selection.
result The two-stage method improves prediction accuracy and active predictor selection.

New method better identifies irrelevant variables for more accurate treatment effect estimation.

problem Handling irrelevant variables in treatment effect estimation with deep disentanglement.
method Deep embedding method to disentangle pre-treatment variables, explicitly identify and represent irrelevant variables, and orthogonalize them.
result Better identification and representation of irrelevant variables lead to more precise treatment effect prediction.

The paper proposes a method to stabilize predictions by identifying causal variables using a seed variable.

problem Stable prediction across unknown test data with potential spurious correlations.
method Conditional independence test based algorithm using a seed variable to separate causal from non-causal variables.
result The algorithm precisely separates causal and non-causal variables for stable prediction across test data.

Variable selection for optimal treatment regime in a clinical trial or an observational study is getting more attention. Most existing variable selection techniques focused on selecting variables that are important for prediction, therefore some variables that are poor in prediction but are critical for decision-making…

2014-05-20abs ↗pdf ↗

A new variable importance measure for DRFs detects broader impacts on output distributions.

problem Estimating full conditional distributions of multivariate outputs given inputs.
method Based on the drop and relearn principle and MMD distance.
result Consistent and high-performing variable importance measure for DRFs.

The paper investigates causal relationships in heart failure prediction using machine learning.

problem Understanding the causal relationships between clinical variables and heart failure.
method Proposes a new computational framework for causal structure discovery (CSD) of mixed-type clinical variables for binary disease outcomes.
result Feature importance from nonlinear classifiers strongly correlates with causal strength of variables, but not differentiating cause and effect.

This review explores the use of machine learning in discovering collective variables for biomolecular dynamics.

problem Understanding the conformational dynamics and molecular recognition in biomolecules.
method Statistical analysis of high-dimensional spatiotemporal data generated from molecular dynamics simulations.
result Machine learning algorithms can be used to discover abstract collective variables that describe biomolecular dynamics.

Researchers identify latent variables and causal structures from nonlinear hierarchical models.

problem Challenging task of identifying latent variables and causal structures from observational data, especially when relationships are nonlinear.
method Investigated nonlinear latent hierarchical causal models, developed identification criterion, and constructed an estimation procedure.
result Identifiability of causal structures and latent variables achieved under mild assumptions.

We propose a procedure for assigning a relevance measure to each explanatory variable in a complex predictive model. We assume that we have a training set to fit the model and a test set to check the out of sample performance. First, the individual relevance of each variable is computed by comparing the predictions in …

2019-12-13abs ↗pdf ↗

The paper shows how neural networks with less decision boundary variability generalize better.

problem Improving neural network generalizability by reducing decision boundary variability.
method Introduces new measures (algorithm DB variability and (ε,η)(ε, η)-data DB variability) to quantify decision boundary variability and proves theoretical bounds on generalizability.
result Neural networks with lower decision boundary variability have better generalizability, as shown by extensive experiments and theoretical bounds.

The architectures of deep neural networks (DNN) rely heavily on the underlying grid structure of variables, for instance, the lattice of pixels in an image. For general high dimensional data with variables not associated with a grid, the multi-layer perceptron and deep belief network are often used. However, it is freq…

2019-12-07abs ↗pdf ↗

Second-order economic theory considers new variables to improve price volatility predictions.

problem Current economic models focus on first-order variables, missing second-order variables that affect price volatility.
method Introduces second-order economic theory with new variables composed of sums of squares of agents' transactions.
result Second-order economic theory complements first-order variables and introduces new macroeconomic variables.