This work addresses dynamic KDE data structures with robustness to adversarial queries.
problem Efficient KDE data structures for dynamic changing data distributions.
method Developed a theoretical framework for KDE data structures that support subquadratic space, sublinear updates, and adaptive queries.
result Theoretical framework and practical implementation of KDE data structures robust to adversarial queries.
Most structure inference methods either rely on exhaustive search or are purely data-driven. Exhaustive search robustly infers the structure of arbitrarily complex data, but it is slow. Data-driven methods allow efficient inference, but do not generalize when test data have more complex structures than training data. I…
Proposes a differentiable structure learning framework for general binary data.
problem Limitations of existing methods in discrete data structure learning.
method Formulates a differentiable optimization task for arbitrary dependencies in general discrete models.
result Establishes identifiability of complete set of compatible parameters and structures under mild assumptions.
Performing machine learning on structured data is complicated by the fact that such data does not have vectorial form. Therefore, multiple approaches have emerged to construct vectorial representations of structured data, from kernel and distance approaches to recurrent, recursive, and convolutional neural networks. Re…
The workshop focuses on AI principles for structured data.
problem Using AI on structured data for decision-making.
method Addressing principles of privacy, accountability, interpretability, robustness, and reasoning.
result Designing approaches to use structured data for reliable decisions.
This work refines Cover's theory for binary classification on low-dimensional data.
problem The challenge of analyzing how low-dimensional data structures affect classification models.
method Refines Cover's function-counting theory to account for low-dimensional data structure.
result Derives dichotomy counts and analyzes the impact of data structure on classification models.
GraphToken encodes structured data for LLMs, improving graph reasoning tasks.
problem Efficiently encoding structured data for large language models.
method GraphToken learns an encoding function to extend prompts with explicit structured information.
result Significant improvements across node, edge, and graph-level tasks on the GraphQA benchmark.
Structured missing data complicates machine learning, presenting new challenges.
problem Structured missingness in data hinders machine learning at scale.
method No specific method is proposed; challenges are outlined.
result Structured missingness poses fundamental hindrance to machine learning.
New topological methods for hypergraph data improve community detection and pattern recognition.
problem Community detection and pattern recognition in hypergraph data.
method Introducing a new topological space structure of hypergraph data, proposing modified nearest neighbors methods.
result Improved methods for community detection and pattern recognition in hypergraph data.
Some recent studies have suggested using GANs for numeric data generation such as to generate data for completing the imbalanced numeric data. Considering the significant difference between the dimensions of the numeric data and images, as well as the strong correlations between features of numeric data, the convention…
Generative Adversarial Networks create synthetic data for structural damage detection.
problem Data scarcity in structural damage detection.
method 1-D Wasserstein Deep Convolutional Generative Adversarial Networks (1-D WDCGAN-GP) for synthetic data generation.
result Generated synthetic data improves damage detection accuracy in 1-D Deep Convolutional Neural Networks.
In this paper we propose Structuring AutoEncoders (SAE). SAEs are neural networks which learn a low dimensional representation of data which are additionally enriched with a desired structure in this low dimensional space. While traditional Autoencoders have proven to structure data naturally they fail to discover sema…
New framework extracts useful information from tensor data with structural properties.
problem Extract useful information from tensor data with structural properties.
method Proposed an additive tensor decomposition (ATD) framework and an ADMM algorithm to solve the high dimensional optimization problem.
result Versatile and effective framework demonstrated in simulations and real medical image analysis.
Effective modeling of electronic health records (EHR) is rapidly becoming an important topic in both academia and industry. A recent study showed that using the graphical structure underlying EHR data (e.g. relationship between diagnoses and treatments) improves the performance of prediction tasks such as heart failure…
FedDAG learns DAG structures from decentralized data.
problem Learning DAG structures from private decentralized data.
method Gradient-based framework with two-level structures.
result FedDAG learns DAG structure without direct data sharing.
A new method learns causal structure from data using amortized inference.
problem Causal structure learning is a combinatorial search problem that is costly and difficult to design suitable scores or tests.
method Train a variational inference model to predict causal structure from data.
result Our inference model generalizes well to larger problem instances and outperforms existing algorithms, especially in genomics.
Study of online learning for structured prediction problems.
problem Structured prediction in online learning settings.
method Developed algorithms for structured prediction in online learning, generalizing from supervised learning.
result Achieved the same excess risk upper bound for non-i.i.d. data and bounded the stochastic regret for non-stationary data.
Library learns Bayesian networks from mixed data without discretization.
problem Learning Bayesian networks from mixed data (discrete and continuous variables).
method Proposes an algorithm for structural and parameter learning of Bayesian networks from mixed data using a mixed MI score function and Gaussian approximation. Offers two graph structure enumeration algorithms.
result Advantages in solving approximation and gap recovery problems on synthetic and real datasets.
Diffusion models reveal latent hierarchical structure in data.
problem Quantitative measurement of data's hierarchical structure.
method Forward-backward experiments in diffusion models.
result Changes in latent variables manifest as correlated chunks in data.
The Random Projection Tree structures proposed in [Freund-Dasgupta STOC08] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of data. We prove new results for both the RPTreeMax and the RPTreeMean data structures. Our result for RPTreeMax gives a near-optimal…
New method discovers causal relationships in sparse linear data.
problem Discovering cause-effect relationships in sparse linear data.
method Uses structural matrix to reconstruct data and identify causal structures without independence tests.
result Outperforms existing methods in sparse causal structure recovery.
Surveying joint Gaussian graphical models to identify shared structures across domains.
problem Estimating shared structures across different data sources.
method Statistical inference of joint Gaussian graphical models.
result Improved estimation power for high-dimensional data.
A framework evaluates synthetic tabular data quality objectively.
problem Lack of an objective interpretation of tabular data metrics.
method Proposes a single mathematical objective for synthetic tabular data distribution, structurally decomposes it, and unifies existing metrics.
result Synthesizers that represent tabular structure outperform other methods, especially on smaller datasets.
Structure inference is an important task for network data processing and analysis in data science. In recent years, quite a few approaches have been developed to learn the graph structure underlying a set of observations captured in a data space. Although real-world data is often acquired in settings where relationship…
ACV improves structured data CV, handling dependence and noisy initial fits.
problem Structured data CV is slow due to expensive algorithm re-runs.
method Extend ACV to handle dependence and noisy initial fits.
result ACV provides accurate and efficient CV for structured data.
Geometric framework detects outliers in high-dimensional data.
problem Detecting outliers in high-dimensional data.
method Geometric framework exploiting manifold structure.
result Significant improvement in outlier detection in high-dimensional data.
FACTM combines FA with correlated topic modeling for structured data integration.
problem Integrating structured data modalities like text and single cell sequencing.
method Bayesian FACTM model combining FA and correlated topic modeling with variational inference.
result FACTM outperforms other methods in identifying clusters in structured data and integrating them with simple modalities.
CSTS benchmarks time series clustering by evaluating correlation structures.
problem Lack of validated ground truth for objectively assessing clustering quality.
method Synthetic benchmark CSTS for evaluating correlation structures in multivariate time series data.
result CSTS enables precise diagnosis of methodological limitations in correlation-based time series clustering.
Unified framework for representation and causal structure learning using exchangeable data.
problem Identifying latent representations or causal structures in non-i.i.d. data.
method Identifiable Exchangeable Mechanisms (IEM) framework for representation and structure learning.
result New insights and identifiability results for causal structure and representation learning.
A new method infers causal gene regulatory networks from parallel CRISPR interventions and transcriptomic data.
problem Learning causal gene regulatory networks from observational data is complicated by lack of identifiability and a combinatorial solution space.
method A continuous optimization framework that leverages observational and interventional data to infer a single causal structure, assuming a linear Structural Equation Model (SEM).
result A provably consistent estimator of the true DAG under mild assumptions.
Continuous-time Bayesian Networks (CTBNs) represent a compact yet powerful framework for understanding multivariate time-series data. Given complete data, parameters and structure can be estimated efficiently in closed-form. However, if data is incomplete, the latent states of the CTBN have to be estimated by laborious…
Paper presents a framework for learning generative models with structured latent factors.
problem Learning controllable and generalizable representations of multivariate data with desired structural properties.
method The paper introduces a novel generative model framework that uses mask variables to model dependency structure and extends the multivariate information bottleneck theory.
result The framework learns semantically meaningful latent factors that reflect various desired structures and can automatically estimate dependency structure from data.
This paper introduces a new method to deceive causal structure learning by omitting data.
problem Deceiving causal structure learning algorithms with incompletely observed data.
method Adversarial missingness attack to bias the learned causal structures.
result Theoretical and practical attack mechanisms are developed for various SCMs.
Proposes a new Bayesian score for learning network structure from related datasets.
problem Learning network structure from heterogeneous related data sets.
method Bayesian Hierarchical Dirichlet (BHD) score based on a hierarchical model.
result BHD outperforms BDeu in reconstruction accuracy and sparsity for related datasets.
Finding an optimal parameter of a black-box function is important for searching stable material structures and finding optimal neural network structures, and Bayesian optimization algorithms are widely used for the purpose. However, most of existing Bayesian optimization algorithms can only handle vector data and canno…
VAELLS learns latent manifold structure to improve VAE model accuracy.
problem VAEs struggle with mismatched latent structure and global structure.
method Integrates learnable manifold model into latent space of VAE.
result Improves model accuracy by matching prior to data manifold structure.
Theory for algebraic data on categories via concentration structures.
problem Defining algebraic structures on categories.
method Introducing concentration structures and concentration monoids.
result Every group can be represented as a concentration monoid of a trivial category.
Leveraging on the underlying low-dimensional structure of data, low-rank and sparse modeling approaches have achieved great success in a wide range of applications. However, in many applications the data can display structures beyond simply being low-rank or sparse. Fully extracting and exploiting hidden structure info…
Develops a framework for causal structure learning using both interventional and observational data.
problem Lack of identifiability of causal structures with only observational data.
method Bilevel polynomial optimization (Bloom) framework for causal structure discovery from interventional and observational data.
result Bloom framework provides convergence and optimality guarantees, surpassing other learning algorithms in experiments.
GTSNE improves data visualization for high-dimensional data.
problem Visualizing high-dimensional data points in a 2D map.
method GTSNE is a variation of t-SNE that captures both local and macro structures.
result GTSNE produces better visualizations of high-dimensional data compared to other methods.
While learning models are typically studied for inputs in the form of a fixed dimensional feature vector, real world data is rarely found in this form. In order to meet the basic requirement of traditional learning models, structural data generally have to be converted into fix-length vectors in a handcrafted manner, w…
We consider structure discovery of undirected graphical models from observational data. Inferring likely structures from few examples is a complex task often requiring the formulation of priors and sophisticated inference procedures. Popular methods rely on estimating a penalized maximum likelihood of the precision mat…
Paper presents a method for imputing and forecasting structural response from incomplete sensor data.
problem Missing sensor data in structural health monitoring (SHM).
method Incremental Bayesian tensor learning for spatiotemporal missing data reconstruction and forecasting.
result The proposed method achieves accurate and robust imputation and prediction even with high rates of missing data.
New method learns DAG structure in clustered data, accounting for local variations.
problem Learning DAG structure in clustered data with varying effects.
method Extends mixed models to structure learning, using a differentiable graph coupling mechanism.
result Asymptotically recovers true structure, detecting dependencies missed by other methods.
A data-driven approach predicts morphological development under structural instability.
problem Understanding and predicting spatiotemporal complexities of morphogenesis under structural instability.
method Machine-learning framework based on physical modeling of morphogenesis.
result Identification of key bifurcation characteristics and prediction of history-dependent development.
This paper presents a novel method for structural data recognition using a large number of graph models. In general, prevalent methods for structural data recognition have two shortcomings: 1) Only a single model is used to capture structural variation. 2) Naive recognition methods are used, such as the nearest neighbo…
Proposes a new model for testing causal structural priors and synthesizing data.
problem Testing and synthesizing causal structural priors using nonparametric knowledge and neural networks.
method Causal Structural Hypothesis Testing (C-SHT) and Causal Structural Variational Hypothesis Testing (C-SVHT) using deep neural networks.
result Demonstrates out-of-distribution generalization error as a proxy for causal structural prior hypothesis testing.
New method fuses audio and magnetic data to identify underlying subspaces.
problem Identifying complex trends in multi-modality data.
method Robust Group Subspace Recovery (RoGSuRe) algorithm based on group sparsity and bi-sparsity pursuit.
result Competitive performance in clustering and classification of multi-modal data.