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.

169,051 papers · 148 categories

Trend · papers per month

8.3%16.7%25.0%33.3% · Jul 199219922001200920182026
48 results for variable naming

Improves code2vec for Java classes by obfuscating variable names.

problem Code2vec's reliance on variable names makes it vulnerable to typos and attacks.
method Obfuscate variable names during code2vec training and aggregate method embeddings for class-level predictions.
result Obfuscated variable names improve model's robustness and accuracy.

Proposes a new variable grouping approach to improve Bayesian additive regression tree (BART) performance.

problem Improving the predictive performance of BART by reducing nonlinear interactions.
method Variable grouping to identify and separate variables into groups with no nonlinear interactions.
result The proposed GBART method significantly outperforms classical approaches in synthetic and real data experiments.

Harmonic functions of two variables are exactly those that admit a conjugate, namely a function whose gradient has the same length and is everywhere orthogonal to the gradient of the original function. We show that there are also partial differential equations controlling the functions of three variables that admit a c…

2012-05-30abs ↗pdf ↗

In this paper, we propose novel strategies for neutral vector variable decorrelation. Two fundamental invertible transformations, namely serial nonlinear transformation and parallel nonlinear transformation, are proposed to carry out the decorrelation. For a neutral vector variable, which is not multivariate Gaussian d…

2017-05-30abs ↗pdf ↗

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 hybrid model for Bayesian optimization handles mixed variables using MCTS for categorical and GP for continuous.

problem Optimizing functions with mixed variable types (continuous, integer, categorical).
method Merges MCTS for categorical and GP for continuous variables, integrates UCTS search strategy, and dynamically selects kernels.
result Hybrid models outperform traditional methods in Bayesian optimization.

In this paper, a class of statistics named ART (the alternant recursive topology statistics) is proposed to measure the properties of correlation between two variables. A wide range of bi-variable correlations both linear and nonlinear can be evaluated by ART efficiently and equitably even if nothing is known about the…

2016-01-07abs ↗pdf ↗

In this note, we would like to find the laws of electrodynamics in simple economic systems. In this direction, we identify the chief economic variables and parameters, scalar and vector, which are amenable to be put directly into the crouch of the laws of electrodynamics, namely Maxwell's equations. Moreover, we obtain…

2010-01-12abs ↗pdf ↗

Study tackles causal structure learning in linear models with unobserved variables and measurement error.

problem Challenges of unobserved common causes and measurement error in causal structure learning.
method Introduces LV-SEM-ME model with four types of variables and characterizes identifiability under separability condition.
result Establishes form of identification robustness for target effect in broader LV-SEM-ME model.

We show a connection between the Fourier spectrum of Boolean functions and the REINFORCE gradient estimator for binary latent variable models. We show that REINFORCE estimates (up to a factor) the degree-1 Fourier coefficients of a Boolean function. Using this connection we offer a new perspective on variance reduction…

2018-08-12abs ↗pdf ↗

Graphical models are commonly used tools for modeling multivariate random variables. While there exist many convenient multivariate distributions such as Gaussian distribution for continuous data, mixed data with the presence of discrete variables or a combination of both continuous and discrete variables poses new cha…

2014-04-29abs ↗pdf ↗

In this manuscript we analyse the leading statistical properties of fluctuations of (log) 3-month US Treasury bill quotation in the secondary market, namely: probability density function, autocorrelation, absolute values autocorrelation, and absolute values persistency. We verify that this financial instrument, in spit…

2007-06-08abs ↗pdf ↗

Using the one dimensional free particle symmetries, the quantum finance symmetries are obtained. Namely, it is shown that Black-Scholes equation is invariant under Schrödinger group. In order to do this, the one dimensional free non-relativistic particle and its symmetries are revisited. To get the Black-Scholes equati…

2013-04-18abs ↗pdf ↗

Langevin autoencoders improve deep latent variable models with efficient posterior sampling.

problem Efficient posterior sampling in deep latent variable models using MCMC.
method Amortized Langevin dynamics (ALD) replaces datapoint-wise sampling with encoder updates.
result ALD is valid as an MCMC algorithm with the target posterior as a stationary distribution.

SlideVaR balances risk and prudence by considering variable investor attitudes.

problem Finding a risk measure that reflects variable investor attitudes and market changes.
method Introducing SlideVaR, a new risk measure that considers risk-tail regions and sub-additivity.
result SlideVaR outperforms traditional measures in markets with frequent state changes.

This paper enhances stability selection by evaluating overall results robustness and identifying optimal regularization values.

problem Improving the robustness and reliability of high-dimensional variable selection.
method Developed a stability estimator to evaluate stability of stability selection results, calibrating key parameters.
result Identified optimal regularization value and improved stability of variable selection.

A new method quickly identifies key variables and interactions.

problem Identifying key variables and interactions in high-dimensional data.
method Kernel trick for sparse orthogonal decomposition in O(# covariates) time.
result Outperforms existing methods for large, high-dimensional data sets.

Proposes a new model for high-dimensional data analysis with unknown link function.

problem Estimating link function, component functions, and variable interactions in high-dimensional data.
method Generalized Sparse Additive Model with Unknown Link Function (GSAMUL) using B-spline basis and MLP network for link estimation, with 2,1\ell_{2,1}-norm regularizer for variable selection.
result Can realize both variable selection and hidden interaction.

We generalise surface cluster algebras to the case of infinite surfaces where the surface contains finitely many accumulation points of boundary marked points. To connect different triangulations of an infinite surface, we consider infinite mutation sequences. We show transitivity of infinite mutation sequences on tria…

2017-04-06abs ↗pdf ↗

The paper classifies symplectic invariants of specific singularities in integrable Hamiltonian systems.

problem Classifying symplectic invariants of singularities in integrable Hamiltonian systems.
method Smooth CC^\infty symplectic classification of Lagrangian fibrations near singularities.
result Action variables form complete CC^\infty symplectic invariants for parabolic orbits and cuspidal tori.

mGENRE improves multilingual entity linking with autoregressive sequence prediction.

problem Multilingual Entity Linking (MEL) task of resolving language-specific mentions to a multilingual Knowledge Base.
method Autoregressive sequence-to-sequence system that cross-encodes mention strings and entity names.
result Over 50% improvement in average accuracy in zero-shot settings.

Three results in p-convex geometry are established. First is the analogue of the Levi problem in several complex variables, namely: local p-convexity implies global p-convexity. The second asserts that the support of a minimal p-dimensional current is contained in the p-hull of the boundary union with the "core" of the…

2011-11-16abs ↗pdf ↗

Estimates and infers multi-stage stationary treatment policies with variable selection.

problem Valid inference for multi-stage stationary treatment policies with high-dimensional feature variables.
method Estimate the value function using augmented inverse probability weighted estimator, apply penalty for variable selection, construct one-step improvements for valid inference.
result Improved estimators are asymptotically normal, valid inference for policy parameters demonstrated.

CLOUD method detects causal relationships in various data types without latent variable assumptions.

problem Detecting causal relationships in the presence of unobserved common causes.
method CLOUD method using Normalized Maximum Likelihood (NML) Code for various data types (discrete, mixed, continuous).
result CLOUD method is more effective than existing methods in inferring causal relationships.

We introduce Thurstonian Boltzmann Machines (TBM), a unified architecture that can naturally incorporate a wide range of data inputs at the same time. Our motivation rests in the Thurstonian view that many discrete data types can be considered as being generated from a subset of underlying latent continuous variables, …

2014-08-01abs ↗pdf ↗

The paper proves a new method to improve generalization in covariate-shift scenarios.

problem Improving performance on test distributions that differ from training distributions.
method Independence-driven importance weighting algorithms for feature selection.
result Theoretical proof that these algorithms can identify optimal variables for covariate-shift generalization.

ABM automates feature engineering and variable selection for loss-based models.

problem Improving model performance through better feature engineering and variable selection.
method ABM uses group and fused lasso regularization to automatically select cutting points and variables.
result ABM integrates feature engineering, variable selection, and model training.