Unified RNN handles five feature types for better time series modeling.
problem Handling diverse feature types in time series data.
method Unified RNN framework that separates features into sparse and dense, and incorporates time and static features.
result Unified RNN framework increases performance compared to standard cells.
A novel graph spectral method for mixed categorical and numerical data.
problem Feature learning for mixed data types (numerical and categorical).
method Graph spectral decomposition of the graph Laplacian to model probabilistic dependence structure.
result Increased separability and clusterability of observations in the transformed feature space.
A new method generates mixed-type features in tabular data with improved realism and accuracy.
problem Generating mixed-type features combining discrete and continuous data is challenging.
method A cascaded approach: first generates low-resolution categorical and coarse numerical features, then uses these in a high-resolution flow matching model.
result The model significantly improves detection scores, generating more realistic samples and capturing distributional details.
Proposes CDTD, a diffusion model for mixed-type tabular data.
problem Adapting diffusion models to mixed-type tabular data.
method Score matching and score interpolation for continuous features, adaptive noise schedules for categorical features.
result Consistently outperforms state-of-the-art models in mixed-type tabular data.
Phytoplankton plays an important role in marine ecosystem. It is defined as a biological factor to assess marine quality. The identification of phytoplankton species has a high potential for monitoring environmental, climate changes and for evaluating water quality. However, phytoplankton species identification is not …
New method generates diverse EHR data types while maintaining privacy.
problem Privacy risks in sharing EHRs across large scales.
method Refined GAN model, feature constraints, and utility measures.
result New model preserves EHR statistics, correlations, and constraints.
gOMP algorithm selects features for various types of data.
problem Feature selection for scalable molecular data.
method Generalized Orthogonal Matching Pursuit algorithm for multiple types of data.
result gOMP performs similarly or better than LASSO on various datasets.
The paper explores features from orderbooks to improve intraday electricity price forecasting.
problem Improving probabilistic forecasting of intraday electricity prices.
method Extracted 384 features from orderbooks, selected powerful features, and benchmarked models across two countries and product types.
result Revealed an asymmetric generalization phenomenon in electricity price forecasting models.
We investigate a class of feature allocation models that generalize the Indian buffet process and are parameterized by Gibbs-type random measures. Two existing classes are contained as special cases: the original two-parameter Indian buffet process, corresponding to the Dirichlet process, and the stable (or three-param…
As machine learning is applied to an increasing variety of complex problems, which are defined by high dimensional and complex data sets, the necessity for task oriented feature learning grows in importance. With the advancement of Deep Learning algorithms, various successful feature learning techniques have evolved. I…
New unsupervised feature selection method for imbalanced datasets.
problem Feature selection challenges in imbalanced multi-class datasets.
method Distance Rank Score using Spearman's Rank Correlation.
result Outperforms existing methods on clustering problems.
Paper proposes a new model using Capsule Networks to classify malware types.
problem Classifying malware types with varying behaviors.
method Ensemble Capsule Network model using bootstrap aggregating.
result Improved accuracy in classifying malware types.
Proposes a new method to find features affecting treatment effect distribution.
problem Existing methods fail to detect differences in treatment effect distribution parameters other than the mean.
method Formulates and estimates a feature importance measure that quantifies feature influence on potential outcome distribution discrepancies. Develops a feature selection algorithm to control type I error rate.
result Successfully discovers important features and outperforms existing mean-based methods.
AIME embeds multi-omics data to adjust confounders and find related features.
problem Extracting meaningful relationships between complex omics data types while accounting for confounders.
method Autoencoder-based deep learning approach that incorporates clinical confounders.
result AIME effectively adjusts for confounders and extracts biologically relevant features.
Paper proposes BSP to find stable bimodules of cross-correlated features.
problem Identify groups of features from two data types with strong cross-correlation.
method Iterative-testing based bimodule search procedure (BSP).
result BSP outperforms existing methods in detecting stable bimodules.
VAEM extends VAEs to handle mixed-type data heterogeneity.
problem Heterogeneous data with different types and marginal distributions.
method Two-stage training approach to handle mixed-type data.
result VAEM improves deep generative model performance on diverse tasks.
In this paper, we aim to develop a unified view of causal and non-causal feature selection methods. The unified view will fill in the gap in the research of the relation between the two types of methods. Based on the Bayesian network framework and information theory, we first show that causal and non-causal feature sel…
We develop meta-path embeddings to improve feature learning in heterogeneous knowledge graphs.
problem Redundant and unsuitable categorical features in meta-paths for machine learning models.
method Skipgram model with meta-path extension for learning semantical and compact vector representations.
result Meta-path embeddings improve link prediction on Wikidata.
Automated feature selection is important for text categorization to reduce the feature size and to speed up the learning process of classifiers. In this paper, we present a novel and efficient feature selection framework based on the Information Theory, which aims to rank the features with their discriminative capacity…
New method selects causal features from diverse data types.
problem Discovering causal relationships from non-continuous data types.
method Transformation-Model (TRAM) based Invariant Causal Prediction (TRAM-ICP) with TRAM-GCM and TRAM-Wald tests.
result Improved power and type I error control for diverse response types.
Random neural nets learn Black-Scholes PDEs without dimensionality issues.
problem Learning Black-Scholes type PDEs efficiently in high dimensions.
method Random feature neural networks applied to Kolmogorov PDEs.
result Random neural nets avoid the curse of dimensionality for Black-Scholes PDEs.
Proposes a new model to predict polymer properties by integrating various data types.
problem Inaccurate polymer property prediction due to separate modeling of different data types.
method Multi-modal cascade feature transfer using GCN for chemical structure and molecular descriptors.
result Empirically evaluated model shows higher predictive performance than single-feature approaches.
Paper predicts EEG features from acoustic features using RNN and GAN.
problem Predicting EEG features from acoustic features.
method Recurrent Neural Network (RNN) and Generative Adversarial Network (GAN).
result Lower RMSE and normalized RMSE values compared to generating acoustic features from EEG features.
Enhances random forest performance with exogenous randomness.
problem Improving random forest performance through exogenous randomness.
method Developed non-asymptotic MSE expansions for individual trees and forests, identified two types of randomness, and conducted simulations.
result Exogenous randomness, particularly feature subsampling, reduces both bias and variance of random forests.
Develops a feature selection method for multi-view data with mixed types.
problem Challenges in feature selection for high-dimensional multi-view data with mixed data types.
method Block Randomized Adaptive Iterative Lasso (B-RAIL) combining randomized Lasso, adaptive weighting, and stability selection.
result Demonstrates effectiveness of B-RAIL in identifying biomarkers and novel candidates for ovarian cancer.
Method uses aggregate crop statistics to improve satellite-based crop type mapping.
problem Limited field-level crop labels for training satellite-based maps.
method Corrects classifier by accounting for shifts in crop type composition and feature means.
result Substantial improvements in overall classification accuracy, reducing misclassifications by 21.9% on average.
Study finds PLI functional connectivity feature superior for depression recognition.
problem Effective detection of depression remains a public health challenge.
method Resting state EEG data collected from MDD and normal controls; various feature types and selection methods evaluated.
result PLI functional connectivity feature superior to linear and nonlinear features; highest classification accuracy 82.31%.
Two new regularization methods improve neural network performance and complexity control.
problem Improving neural network performance and complexity control with correlated or high-dimensional features.
method Two regularization strategies: covariance-aware ridge and covariance-aware lasso.
result Improves predictive performance and complexity control over standard penalties.
This paper compares methods for handling mixed-attribute data in GFMM neural networks.
problem Handling datasets with mixed features in GFMM neural networks.
method Three main methods: encoding, combining with other classifiers, and specific learning algorithms.
result Encoding methods and combining with decision trees improve GFMM models' performance.
Develops a fast test to identify significant features in machine learning models.
problem Identifying significant features and interactions in machine learning models efficiently.
method Forward-selection approach for any model, learning task, and variable type, non-asymptotic, straightforward implementation.
result Identifies statistically significant features and feature interactions of any order.
AdaEnsemble learns adaptive feature interactions for CTR prediction.
problem Learning feature interactions for CTR prediction in recommender systems and Ads ranking.
method AdaEnsemble is a Sparsely-Gated Mixture-of-Experts (SparseMoE) architecture that dynamically selects feature interaction depth.
result AdaEnsemble achieves better prediction accuracy and inference efficiency compared to state-of-the-art models.
Pyramidal GNN combines RC and pooling for efficient graph embeddings.
problem Efficiently embedding graphs while maintaining accuracy.
method Alternates RC layers with pooling to reduce complexity.
result Formally shows how pooling reduces complexity and speeds convergence.
Paper proposes Gini distance statistics for estimating feature-label dependence.
problem Identifying statistical dependence between features and categorical labels.
method Generalized Gini distance in RKHS for feature-label dependence estimation.
result Gini distance statistics converge faster and have tighter error bounds than distance covariance.
New extremal Poincaré type metrics found via blow-up theorem.
problem Finding new extremal Poincaré type metrics.
method Proved Arezzo-Pacard-Singer blow-up theorem for Poincaré type metrics and applied to new examples.
result Found new examples of extremal Poincaré type metrics with an additional obstruction.
SeizureNet classifies EEG seizures with high accuracy.
problem Challenges in classifying epileptic seizures due to signal quality and patient variability.
method Deep learning framework using multi-spectral feature embeddings and knowledge distillation.
result SeizureNet achieves high F1 scores for seizure and patient-wise classification.
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.
Aggregates predictions from multiple regression models using random projections and kernel methods.
problem Combining predictions from multiple regression models to improve accuracy.
method Random projection of high-dimensional feature space, followed by kernel-based consensual aggregation.
result The aggregation scheme performs similarly to using the original high-dimensional features, with high probability.
Two new Hie-TAN and Hie-TAN-Lite algorithms improve TAN for hierarchical feature spaces.
problem Learning dependencies in hierarchical feature spaces.
method Exploits hierarchical parent-child relationships as constraints to learn a dependency tree.
result Hie-TAN-Lite outperforms Hie-TAN and other methods in predictive accuracy.
In this paper we provide a new Bennequin-type inequality for the Rasmussen- Beliakova-Wehrli invariant, featuring the numerical transverse braid invariants (the c-invariants) introduced by the author. From the Bennequin type-inequality, and a combinatorial bound on the value of the c-invariants, we deduce a new computa…
AFD learns features resistant to adversarial attacks.
problem Vulnerability of neural networks to adversarial attacks.
method AFD learns features invariant to adversarial perturbations through a game of predictive and robust features.
result AFD effectively resists a wide range of attack types and strengths.
DCoM uses deep neural networks to detect semantic data types from raw column values.
problem Detecting semantic data types from dirty and unseen data.
method DCoM employs multi-input NLP-based deep neural networks trained on 686,765 data columns.
result DCoM outperforms existing methods significantly on 78 different semantic data types.
Study shows caste's reduced importance in predicting women's work status and type.
problem Social disadvantage and caste impact women's work status and type in India.
method Interpreted machine learning models using feature attribution.
result Caste is less influential in predicting work for younger women compared to older women.
It has long been recognized that the invariance and equivariance properties of a representation are critically important for success in many vision tasks. In this paper we present Steerable Convolutional Neural Networks, an efficient and flexible class of equivariant convolutional networks. We show that steerable CNNs …
Motivation: State-of-the-art biomedical named entity recognition (BioNER) systems often require handcrafted features specific to each entity type, such as genes, chemicals and diseases. Although recent studies explored using neural network models for BioNER to free experts from manual feature engineering, the performan…
We introduce a method called multi-scale local shape analysis, or MLSA, for extracting features that describe the local structure of points within a dataset. The method uses both geometric and topological features at multiple levels of granularity to capture diverse types of local information for subsequent machine lea…
The paper studies multiple descent in multi-component prediction models.
problem Understanding the risk curves in multi-component prediction models.
method Investigates a 'double random feature model' and 'multiple random feature model' in ridge regression.
result Risk curves of multi-component prediction models can exhibit multiple descents.
GraphDINO learns neuronal morphologies from unlabeled data.
problem Unsupervised learning of neuronal morphologies from unlabeled data.
method Transformer-based approach with novel attention mechanism and data augmentation.
result GraphDINO yields morphological clusterings on par with expert classification.
Theoretical analysis of vision transformers' performance with MAE and CL objectives.
problem Understanding the distinct representations learned by vision transformers with MAE and CL objectives.
method Modeling visual data distribution and analyzing ViTs training dynamics with gradient descent.
result ViTs trained with MAE objectives learn both global and local features, while CL-trained ViTs favor global features.