arXiv research

A new screening method for high-dimensional data reduces computational cost.

Although much progress has been made in classification with high-dimensional features \citep{Fan_Fan:2008, JGuo:2010, CaiSun:2014, PRXu:2014}, classification with ultrahigh-dimensional features, wherein the features much outnumber the sample size, defies most existing work. This paper introduces a novel and computation…

Learning expressive low-dimensional representations of ultrahigh-dimensional data, e.g., data with thousands/millions of features, has been a major way to enable learning methods to address the curse of dimensionality. However, existing unsupervised representation learning methods mainly focus on preserving the data re…

Statistical inference can be computationally prohibitive in ultrahigh-dimensional linear models. Correlation-based variable screening, in which one leverages marginal correlations for removal of irrelevant variables from the model prior to statistical inference, can be used to overcome this challenge. Prior works on co…

We propose a flexible nonparametric regression method for ultrahigh-dimensional data. As a first step, we propose a fast screening method based on the favored smoothing bandwidth of the marginal local constant regression. Then, an iterative procedure is developed to recover both the important covariates and the regress…

Solar improves variable selection in high-dimensional data with complicated dependence structures.

Modern bio-technologies have produced a vast amount of high-throughput data with the number of predictors far greater than the sample size. In order to identify more novel biomarkers and understand biological mechanisms, it is vital to detect signals weakly associated with outcomes among ultrahigh-dimensional predictor…

The lasso model has been widely used for model selection in data mining, machine learning, and high-dimensional statistical analysis. However, with the ultrahigh-dimensional, large-scale data sets now collected in many real-world applications, it is important to develop algorithms to solve the lasso that efficiently sc…

A new graphical model for discrete data without parametric restrictions.

Penalized regression models such as the lasso have been extensively applied to analyzing high-dimensional data sets. However, due to memory limitations, existing R packages like glmnet and ncvreg are not capable of fitting lasso-type models for ultrahigh-dimensional, multi-gigabyte data sets that are increasingly seen …

Proposes a method to select features for deep learning in noisy, high-dimensional data.

Estimates complex dependency structures in multi-omics data.

Develops high-dimensional measurement error models for non-linear loss functions.

Variable selection in high-dimensional space characterizes many contemporary problems in scientific discovery and decision making. Many frequently-used techniques are based on independence screening; examples include correlation ranking (Fan and Lv, 2008) or feature selection using a two-sample t-test in high-dimension…

The paper uses graph learning to detect valid instruments in high-dimensional data for house pricing.

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

MDS selects assets by combining daily returns and intraday risk curves, improving portfolio performance.

Sparse symmetric tensor regression reduces brain connectivity complexity.

Ultrahigh-dimensional variable selection plays an increasingly important role in contemporary scientific discoveries and statistical research. Among others, Fan and Lv [J. R. Stat. Soc. Ser. B Stat. Methodol. 70 (2008) 849-911] propose an independent screening framework by ranking the marginal correlations. They showed…

A new method reduces feature screening cost from $O(np)$ to $O(\sqrt{n}p)$.

Big data sets must be carefully partitioned into statistically similar data subsets that can be used as representative samples for big data analysis tasks. In this paper, we propose the random sample partition (RSP) data model to represent a big data set as a set of non-overlapping data subsets, called RSP data blocks,…

A new method for handling imbalanced big data using ensembles and smart data.

Prevents sensitive data generation in diffusion models using labeled and unlabeled data.

Study reveals Data Shapley's inconsistent performance in data selection tasks.

PRRO generates synthetic tabular data that improves SL performance and class distribution.

Defines data science as a natural ecosystem with challenges and missions.

Synthetic data enhances analytics but requires careful volume management.

Proposes using probabilistic models for privacy-preserving synthetic data.

New test ensures quality of shared data in machine learning.

Paper creates fair synthetic data ensuring equal predictions across sensitive attributes.

DPA preserves data distribution in reduced dimensions.

Efficient synthetic data generation improves model performance on tabular data.

For most problems in science and engineering we can obtain data sets that describe the observed system from various perspectives and record the behavior of its individual components. Heterogeneous data sets can be collectively mined by data fusion. Fusion can focus on a specific target relation and exploit directly ass…

DAERNN models censored data using neural networks with data augmentation.

Data preprocessing techniques are devoted to correct or alleviate errors in data. Discretization and feature selection are two of the most extended data preprocessing techniques. Although we can find many proposals for static Big Data preprocessing, there is little research devoted to the continuous Big Data problem. A…

Data stream classification methods demonstrate promising performance on a single data stream by exploring the cohesion in the data stream. However, multiple data streams that involve several correlated data streams are common in many practical scenarios, which can be viewed as multi-task data streams. Instead of handli…

Data collection is a major bottleneck in machine learning and an active research topic in multiple communities. There are largely two reasons data collection has recently become a critical issue. First, as machine learning is becoming more widely-used, we are seeing new applications that do not necessarily have enough …

This paper quantifies uncertainty in Data Shapley using statistical inference.

DCoM uses deep neural networks to detect semantic data types from raw column values.

Causal inference from observational data is the goal of many data analyses in the health and social sciences. However, academic statistics has often frowned upon data analyses with a causal objective. The introduction of the term "data science" provides a historic opportunity to redefine data analysis in such a way tha…

Task-agnostic data valuation without validation requirements.

Data mining is about obtaining new knowledge from existing datasets. However, the data in the existing datasets can be scattered, noisy, and even incomplete. Although lots of effort is spent on developing or fine-tuning data mining models to make them more robust to the noise of the input data, their qualities still st…

Framework generates private synthetic data for unlabeled mixed-type data.

New algorithm improves data imputation for complex multimodal data sets.

New algorithms for clustering and synthetic data generation of heterogeneous tabular datasets.

WeMix improves data augmentation by correcting bias in deep learning.

A new method reduces data valuation variance for more trustworthy data trading.

Adapts data analysis for growing data, improving generalization guarantees.