arXiv research

Survey on learning with graph-dependent data, deriving new generalization bounds.

Paper improves risk bound for MTL with graph-dependent data.

A crucial assumption in most statistical learning theory is that samples are independently and identically distributed (i.i.d.). However, for many real applications, the i.i.d. assumption does not hold. We consider learning problems in which examples are dependent and their dependency relation is characterized by a gra…

Graph convolutional networks adapt the architecture of convolutional neural networks to learn rich representations of data supported on arbitrary graphs by replacing the convolution operations of convolutional neural networks with graph-dependent linear operations. However, these graph-dependent linear operations are d…

We propose graph-dependent implicit regularisation strategies for distributed stochastic subgradient descent (Distributed SGD) for convex problems in multi-agent learning. Under the standard assumptions of convexity, Lipschitz continuity, and smoothness, we establish statistical learning rates that retain, up to logari…

The paper gives bounds for how long it takes for gossip protocols to spread information in networks.

We propose a method for non-projective dependency parsing by incrementally predicting a set of edges. Since the edges do not have a pre-specified order, we propose a set-based learning method. Our method blends graph, transition, and easy-first parsing, including a prior state of the parser as a special case. The propo…

Semi-implicit graph variational auto-encoder (SIG-VAE) is proposed to expand the flexibility of variational graph auto-encoders (VGAE) to model graph data. SIG-VAE employs a hierarchical variational framework to enable neighboring node sharing for better generative modeling of graph dependency structure, together with …

IGNN captures long-range graph dependencies using fixed-point equations.

New framework relaxes independence assumption for graph-mixing dependencies.

Gaussian graphical models are widely used to represent conditional dependence among random variables. In this paper, we propose a novel estimator for data arising from a group of Gaussian graphical models that are themselves dependent. A motivating example is that of modeling gene expression collected on multiple tissu…

Study on sample complexity for pure exploration in feedback graph settings.

Deep Gaussian Processes model functions on DAGs with partially observed data.

RR-GNN improves GNN prediction intervals by accounting for graph heteroscedasticity and structural biases.

Adaptive-Step Graph Meta-Learner tackles few-shot graph classification with limited labeled data.

Proposes a graph dynamics prior for more accurate relational inference.

New test detects local changes in high-dimensional Gaussian graphical models online.

Stochastic gradient descent achieves polynomial convergence rates for noiseless linear models.

A deep RL approach learns multi-agent coordination through dynamic graph communication.

LOBSTUR-GNN adapts bootstrapping for unsupervised GNNs, improving node representation learning.

New formalism for decision making combines causal structures with MDPs, improving reinforcement learning performance.

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.

New test ensures quality of shared data in machine learning.

Differential privacy allows quantifying privacy loss resulting from accessing sensitive personal data. Repeated accesses to underlying data incur increasing loss. Releasing data as privacy-preserving synthetic data would avoid this limitation, but would leave open the problem of designing what kind of synthetic data. W…

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…

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.