Various factorization-based methods have been proposed to leverage second-order, or higher-order cross features for boosting the performance of predictive models. They generally enumerate all the cross features under a predefined maximum order, and then identify useful feature interactions through model training, which…
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
48 results for “feature ordering”
New method disentangles high-order effects in feature importance.
problem Quantifying cooperative effects in feature importance.
method Adaptive Leave One Covariate Out (LOCO) method to decompose LOCO into two-body and higher-order components.
result Decomposes LOCO into two-body and higher-order components, highlighting synergistic and redundant effects.
Taking into account high-order interactions among covariates is valuable in many practical regression problems. This is, however, computationally challenging task because the number of high-order interaction features to be considered would be extremely large unless the number of covariates is sufficiently small. In thi…
We develop a theory of higher-order feature attribution for complex models.
problem Interpreting feature contributions in models with interactions is challenging.
method We extend Integrated Gradients (IG) to higher-order feature attributions.
result We establish natural connections to statistics and topological signal processing.
We introduce features for massive data streams. These stream features can be thought of as "ordered moments" and generalize stream sketches from "moments of order one" to "ordered moments of arbitrary order". In analogy to classic moments, they have theoretical guarantees such as universality that are important for lea…
Hermite polynomials improve private data generation by reducing feature count.
problem Infinite-dimensional features in kernel mean embedding are impractical for private data generation.
method Replace random features with Hermite polynomial features, leveraging their ordered nature.
result Hermite polynomial features yield a more accurate approximation of kernel mean embedding with fewer features.
Finding statistically significant high-order interaction features in predictive modeling is important but challenging task. The difficulty lies in the fact that, for a recent applications with high-dimensional covariates, the number of possible high-order interaction features would be extremely large. Identifying stati…
Paper introduces a framework for diagnosing Alzheimer's disease using higher-order topological features from fMRI.
problem Diagnosing Alzheimer's disease using brain network topology.
method Persistent homology to extract higher-order features (cycles, cavities) from fMRI data.
result Framework significantly outperforms existing methods in AD classification.
GEM improves recommendation by capturing complex feature interactions.
problem Capturing complex high-order interaction signals in feature-based recommendation models.
method Integrates graph convolution networks to generate high-order embeddings and combines with FM-based models.
result Significant improvement in recommendation performance over baselines.
Proposes an efficient method for ordered counterfactual explanations.
problem Insufficient explanation of perturbation vectors for executing actions.
method Mixed-Integer Linear Optimization (MILP) approach for evaluating and extracting optimal pairs of actions and orders.
result Demonstrated effectiveness of the proposed method on real datasets.
Forecasting the movements of stock prices is one the most challenging problems in financial markets analysis. In this paper, we use Machine Learning (ML) algorithms for the prediction of future price movements using limit order book data. Two different sets of features are combined and evaluated: handcrafted features b…
A new method uses CPD to efficiently model feature interactions in non-sequential data.
problem Efficiently modeling feature interactions in non-sequential data with high computational and memory costs.
method Implicitly represent model parameters as a tensor, factorize into a compact Tensor Train (TT) format, and use Canonical Polyadic (CP) Decomposition for invariance to feature ordering.
result The proposed CP-based predictor outperforms other TN-based predictors on sparse data and matches neural network performance on dense non-sequential tasks.
New method quantifies feature interactions in machine learning models.
problem Capturing high-order interactions and feature contributions in predictive models.
method Information-theoretic approach using Conditional Mutual Information (CMI) via k-NN.
result Accurately recovers feature interactions in synthetic and real-world datasets.
Cross-GCN models cross features in GCN for better performance.
problem GCN's lack of cross feature modeling limits its effectiveness.
method Introduces Cross-feature Graph Convolution (Cross-GCN) to model cross features explicitly.
result Explicit cross feature modeling improves GCN's performance on tasks requiring cross features.
New regularization scheme for FMs improves feature interaction selection.
problem Feature selection in FMs leads to loss of feature interactions.
method Proposes a new regularization scheme for FMs with upper bound of regularizer.
result Improves feature interaction selection without restricting sparsity patterns.
Confident Feature Rankingstat.ML
A framework for quantifying uncertainty in feature importance values.
problem Stable interpretation of feature importance values in machine learning models.
method A novel method based on pairwise comparisons of feature importance values to produce confidence intervals for feature ranks.
result The method produces simultaneous confidence intervals for feature ranks, enabling selection of top-k important features.
Explicit high-order feature interactions efficiently capture essential structural knowledge about the data of interest and have been used for constructing generative models. We present a supervised discriminative High-Order Parametric Embedding (HOPE) approach to data visualization and compression. Compared to deep emb…
Method extracts features from signals for classification with explainability.
problem Lack of interpretability in signal classification models.
method Combining scattering transform and multiclass logistic regression with zeroth-order optimization.
result Uncovered the meaning of scattering transform coefficients.
A limit order book provides information on available limit order prices and their volumes. Based on these quantities, we give an empirical result on the relationship between the bid-ask liquidity balance and trade sign and we show that liquidity balance on best bid/best ask is quite informative for predicting the futur…
The paper predicts Bitcoin volatility using order flow images.
problem Predicting short-term volatility of Bitcoin prices.
method Transformed order flow data into images, trained CNN and ResNet models.
result Order flow representation with CNN achieves best performance, with RMSPE of 0.85+/-1.1.
Derives FACT, an alternative to NFA for neural networks, explaining feature learning.
problem Understanding how neural networks learn representations.
method First-principles approach using first-order optimality conditions.
result FACT explains why NFA holds and provides a principled alternative.
Transformers predict price movements from limit order books.
problem Predicting price movements from limit order books.
method Causal convolutional network with masked self-attention.
result Significantly outperforms existing architectures on FI-2010 dataset.
The paper uses machine learning to detect malicious executable files.
problem Detecting malicious executable files using static analysis.
method Pre-processing, cleaning, encoding, feature selection, and ensemble training of classifiers.
result An ensemble of classifiers effectively detects malicious executable files.
New methods ensure feature importance rankings are correct with high probability.
problem Stability issues in feature importance scores due to random sampling.
method Hypothesis testing-based techniques to assess and verify the stability of top-ranked features.
result Ensures the most important features are correct with high-probability guarantees.
GOTabPFN improves tabular model performance with compact tokenization for HDLSS data.
problem Making tabular models effective for high-dimensional, low-sample size data without retraining.
method Introducing Graph-guided Ordering with Local Refinement (GO-LR) and Neuro-Inspired Subunit Compression (NSC) to create compact meta-features.
result GOTabPFN improves stability and accuracy in tabular benchmarks with compact tokenization.
Deep networks learn features suddenly, akin to a phase transition.
problem Understanding sudden feature learning in deep networks.
method Adaptive kernel approach applied to two teacher-student models.
result Feature learning and Grokking are analogous to a first-order phase transition.
FIVES generates high-order interactive features efficiently and effectively.
problem Automating the generation of high-order interactive features in tabular data.
method Formulates interactive feature generation as edge search on a feature graph, using a GNN and adjacency tensor.
result FIVES outperforms state-of-the-art methods in various datasets and real-world applications.
xDeepInt learns both vector-wise and bit-wise feature interactions.
problem Learning feature interactions for CTR prediction and recommendation.
method Polynomial Interaction Network (PIN) architecture with subspace-crossing mechanism.
result xDeepInt outperforms state-of-the-art models in CTR prediction and recommendation.
We present novel graph kernels for graphs with node and edge labels that have ordered neighborhoods, i.e. when neighbor nodes follow an order. Graphs with ordered neighborhoods are a natural data representation for evolving graphs where edges are created over time, which induces an order. Combining convolutional subgra…
Deep model learns protein interfaces from high-order interactions.
problem Predicting protein interfaces from amino acid pairs.
method Graph neural networks and convolutional neural networks for 2D dense predictions.
result Our method consistently improves interface prediction performance.
Paper evaluates and improves private feature selection methods.
problem Feature selection in high-dimensional datasets with privacy constraints.
method Correlations-based order statistic privatized for feature selection.
result Our method significantly outperforms established baseline for private feature selection.
This thesis responds to the challenges of using a large number, such as thousands, of features in regression and classification problems. There are two situations where such high dimensional features arise. One is when high dimensional measurements are available, for example, gene expression data produced by microarray…
To date, the instability of prognostic predictors in a sparse high dimensional model, which hinders their clinical adoption, has received little attention. Stable prediction is often overlooked in favour of performance. Yet, stability prevails as key when adopting models in critical areas as healthcare. Our study propo…
Neural networks can learn from higher-order cumulants efficiently, requiring quadratic samples.
problem Learning from higher-order cumulants in high-dimensional data.
method Spiked cumulant model, polynomial time algorithms, neural networks, random features.
result Neural networks require quadratic samples to learn from higher-order cumulants efficiently, while random features require more samples.
Proposes a framework to extract ordered eigenfunctions from contextual kernels.
problem Lack of exact spectral decomposition in existing methods.
method Modular building blocks for compatibility with contextual kernels and scalability.
result Extracted eigenfunctions provide effective importance scores for feature selection.
Paper presents a novel approach for global feature aggregation in Graph Neural Networks.
problem Graphs lack a straightforward way to perform non-local feature aggregation like images and texts.
method Utilizes Latent Fixed Data Structure (LFDS) to aggregate feature vectors from local extraction.
result Proposed methods achieve competitive or better results with linear computational complexity.
Trains a neural network to predict high-frequency trading outcomes.
problem Predicting the fill probability function for high-frequency trading.
method High-quality high-frequency data and neural network training with a weighted loss function.
result Strong state dependence properties of the fill probability function.
Recommendation systems and computing advertisements have gradually entered the field of academic research from the field of commercial applications. Click-through rate prediction is one of the core research issues because the prediction accuracy affects the user experience and the revenue of merchants and platforms. Fe…
iLOCO measures feature interactions without assumptions, providing statistical inference.
problem Lack of methods to statistically infer feature interactions.
method iLOCO metric and LOCO inference for distribution-free, efficient computation.
result First inferential approach to detecting feature interactions.
Cost-effective feature selection improves network model choice.
problem Selecting informative features from noisy candidates in network models.
method Adapted feature selection methods to account for feature costs and used pilot simulations.
result Reduced computational cost by two orders of magnitude without sacrificing model accuracy.
Predicts short-term futures contract direction using neural networks and order flow data.
problem Challenges in predicting short-term directional movement of futures contracts.
method Engineering features from technical analysis, order flow, and order-book data; training a Tabnet neural network.
result Achieved an accuracy of 0.601 in predicting directional change on the Silver Futures Contract.
We analyse second order (in Riemann curvature) geometric flows (un-normalised) on locally homogeneous three manifolds and look for specific features through the solutions (analytic whereever possible, otherwise numerical) of the evolution equations. Several novelties appear in the context of scale factor evolution, fix…
This paper poses a few fundamental questions regarding the attributes of the volume profile of a Limit Order Books stochastic structure by taking into consideration aspects of intraday and interday statistical features, the impact of different exchange features and the impact of market participants in different asset s…
Rank regression from pairwise comparisons requires many comparisons to accurately learn model parameters.
problem Learning model parameters for rank regression from noisy pairwise comparisons.
method Uniform random pairwise comparisons to estimate model parameters with a given accuracy.
result Learning model parameters requires a number of comparisons proportional to .
Limit order market analysis and modelling: on an universal cause for over-diffusive pricescond-mat.stat-mech
We briefly review data analysis of the Island order book, part of NASDAQ, which suggests a framework to which all limit order markets should comply. Using a simple exclusion particle model, we argue that short-time price over-diffusion in limit order markets is due to the non-equilibrium of order placement, cancellatio…
Two ANOVA-based algorithms boost random Fourier feature models for function approximation.
problem Approximating high-dimensional functions with low-order interactions.
method Utilizes ANOVA decomposition to learn low-order functions and index sets of important variables.
result Significantly reduces approximation error compared to existing methods.
Analyzes feature learning in neural networks using a self-consistent dynamical field theory.
problem Feature learning in infinite-width neural networks.
method Constructs deterministic dynamical order parameters as inner-product kernels for hidden unit activations and gradients.
result Reveals the hidden layer activation distribution, neural tangent kernel evolution, and output predictions.
New method explains predictive uncertainty by focusing on second-order effects.
problem Explaining predictive uncertainty in machine learning models.
method CovLRP, CovGI, etc., based on second-order effects.
result Predictive uncertainty is dominated by second-order effects.