New metric assesses image dataset complexity.
problem Assessing the complexity of image classification datasets.
method Cumulative Spectral Gradient (CSG) derived from spectral clustering.
result CSG correlates with CNN test accuracy and dataset separability.
SCARY dataset generates complex causal scenarios for causality research.
problem Lack of complexity in existing causal datasets.
method Synthetic dataset with 40 scenarios, three seeds, and two data generation mechanisms.
result Provides a valuable resource for realistic causal discovery.
This work tackles runtime complexity prediction for code, using machine learning and a new dataset.
problem Predicting runtime complexity of code is hard and mathematically impossible.
method Modelled as a machine learning task, using feature engineering and code embeddings, with a new dataset.
result Achieved state-of-the-art results in runtime complexity prediction.
Transformers fine-tuned on synthetic data boost tabular data classification performance.
problem Improving tabular data classification accuracy.
method Fine-tuning ICL-transformers on synthetic datasets with complex decision boundaries.
result Fine-tuned ICL-transformers outperform regular neural networks on real-world datasets.
Proposes a novel method to identify complex effects in multi-view datasets.
problem Challenges in analyzing multi-view biomedical datasets with complex interactions.
method Generalized kernel machine approach considering marginal and joint effects of features from different views.
result Effective identification of higher-order composite effects in multi-view datasets.
Complex activity recognition is challenging due to the inherent uncertainty and diversity of performing a complex activity. Normally, each instance of a complex activity has its own configuration of atomic actions and their temporal dependencies. We propose in this paper an atomic action-based Bayesian model that const…
New method quantifies biases in neuroimaging datasets.
problem Pooling neuroimaging datasets can introduce biases.
method Causal inference to quantify confounding factors.
result Simple pooling often leads to biased training data.
Bayesian nonparametrics adapt model complexity to diverse datasets.
problem Complex challenges across statistics, computer science, and engineering.
method Flexible Bayesian nonparametric models that adapt model complexity.
result Bayesian nonparametrics offer innovative solutions to multi-object tracking.
Proposes a Complex Transformer for complex-valued sequence modeling.
problem Lack of deep learning models for complex-valued data.
method Develops a Complex Transformer using transformer backbone with specialized attention and encoder-decoder networks.
result Achieves state-of-the-art performance on complex-valued datasets.
Large datasets represented by multidimensional data point clouds often possess non-trivial distributions with branching trajectories and excluded regions, with the recent single-cell transcriptomic studies of developing embryo being notable examples. Reducing the complexity and producing compact and interpretable repre…
Generative model synthesizes complex data structures with composite and nested types.
problem Synthesizing complex data structures with composite and nested types.
method Generic framework using causal transformers for struct and list generation.
result Consistently outperforms state-of-the-art models on standard and complex hierarchical datasets.
Integrates MRF into multimodal VAE for better complex intermodal interactions.
problem Lack of effective modeling of complex intermodal interactions in multimodal VAEs.
method Incorporates Markov Random Field into prior and posterior distributions of multimodal VAE.
result Demonstrates superior performance in managing complex intermodal dependencies.
Generative model produces high-fidelity video samples.
problem Generating high-fidelity videos from complex datasets.
method Large GAN trained on Kinetics-600 dataset, using a computationally efficient discriminator.
result Achieved state-of-the-art metrics in video synthesis and prediction.
Metric learning seeks a transformation of the feature space that enhances prediction quality for the given task at hand. In this work we provide PAC-style sample complexity rates for supervised metric learning. We give matching lower- and upper-bounds showing that the sample complexity scales with the representation di…
A new adaptive initialization method for K-means improves clustering performance and reduces complexity.
problem Inability of traditional K-means to adapt to datasets with various characteristics and prone to local optima.
method Adaptive Initialization Method for K-means (AIMK) that dynamically adapts to dataset characteristics and reduces clustering time complexity.
result AIMK-RS significantly reduces clustering time complexity to O(n) and outperforms other methods on large datasets.
This review assesses deep-learning methods for complex sequential data.
problem Lack of robustness and transparency in deep-learning frameworks for irregular sequential data.
method Systematic literature review of existing algorithms.
result Recurrent neural networks dominate in performance evaluation of deep-learning frameworks.
Strong regulations in the financial industry mean that any decisions based on machine learning need to be explained. This precludes the use of powerful supervised techniques such as neural networks. In this study we propose a new unsupervised and semi-supervised technique known as the topological hierarchical decomposi…
Simplified MDNs quantify uncertainty in large complex datasets.
problem Uncertainty quantification in large scale complex data.
method Simplified Mixture Density Networks (MDNs) for regression problems.
result Improved predictive log-likelihood and root-mean-square-error compared to existing methods.
We uncover scaling laws and statistical structure in complex datasets.
problem Understanding universal traits in complex datasets.
method Analogizing data to physical systems, using statistical physics and RMT.
result Real-world datasets and Gaussian data with long-range correlations share the same RMT universality class.
Representation learning becomes especially important for complex systems with multimodal data sources such as cameras or sensors. Recent advances in reinforcement learning and optimal control make it possible to design control algorithms on these latent representations, but the field still lacks a large-scale standard …
A new framework enhances IDW models for complex industrial datasets.
problem Low performance of IDW models in complex industrial datasets.
method Deep reinforcement learning network to enhance IDW models and learn hyperparameters.
result The proposed framework achieves differential spatial prediction and is more accurate than current IDW models.
Modeling complex conditional distributions is critical in a variety of settings. Despite a long tradition of research into conditional density estimation, current methods employ either simple parametric forms or are difficult to learn in practice. This paper employs normalising flows as a flexible likelihood model and …
SPREV simplifies visualization of complex labeled datasets.
problem Challenges of reducing dimensions and visualizing labeled datasets with small class size, high dimensionality, and low sample size.
method SPREV uses a novel dimensionality reduction technique integrating geometric principles.
result SPREV effectively visualizes hidden patterns in complex labeled datasets.
Proposes a method to learn representations of higher-dimensional simplicial complexes.
problem Lack of methods for representing entire simplicial complexes.
method Geometric message passing schemes for end-to-end learning of simplicial complex representations.
result First method for learning representations of entire simplicial complexes.
DeepONet models system discrepancies with low data.
problem Modeling complex systems with limited data.
method Bi-fidelity modeling using DeepONet for uncertain and partially unknown systems.
result DeepONet effectively models complex systems with parametric uncertainty and partial unknownness.
Improves joint distribution learning for high-dimensional datasets with complex correlations.
problem Conditional independence assumption limitations in VAE decoders for high-dimensional datasets.
method Cramer-Wold distance regularization and two-step learning method for flexible prior modeling.
result Effective joint distributional learning for high-dimensional datasets with multiple categorical variables.
Accurate and automated detection of anomalous samples in a natural image dataset can be accomplished with a probabilistic model for end-to-end modeling of images. Such images have heterogeneous complexity, however, and a probabilistic model overlooks simply shaped objects with small anomalies. This is because the proba…
Framework measures learning task complexity, distinguishing from memorization.
problem Measuring and distinguishing learning from memorization in learning tasks.
method Introduces an asymmetric distance and a non-asymptotic framework to compute complexity.
result Framework can measure complexity in large-scale models and real-world datasets.
New metrics assess class overlap and imbalance in datasets.
problem Class overlap and imbalance make datasets hard to classify.
method Developed new metrics based on ball coverage by classes.
result Metrics correlate well with classifier performance.
Proposes a constraint for deep clustering to handle both simple and complex topologies.
problem Limited prior knowledge for deep clustering methods to perform well on complex topologies.
method Introduces a constraint using symmetric InfoNCE to enhance deep clustering performance.
result The constraint improves deep clustering methods' performance on both simple and complex topologies.
We introduce an exact distributed algorithm to train Random Forest models as well as other decision forest models without relying on approximating best split search. We explain the proposed algorithm and compare it to related approaches for various complexity measures (time, ram, disk, and network complexity analysis).…
Global models outperform univariate benchmarks in complex time series forecasting.
problem Comparing global forecasting models to univariate benchmarks in various challenging scenarios.
method Simulated datasets with controlled characteristics, including homogeneity, complexity, and series lengths. Global forecasting models (RNN, LGBM) compared to univariate techniques.
result Global models like RNN and LGBM are competitive in complex scenarios with short series lengths and heterogeneous data.
PhysicsFormer improves TSF models for GSWF with WEATHER-5K dataset.
problem Lack of comprehensive datasets for GSWF.
method PhysicsFormer combines dynamic core and Transformer, enforcing physical consistency.
result PhysicsFormer outperforms TSF models in operational forecasting.
New undersampling method reduces computational complexity for imbalanced datasets.
problem Data imbalance in machine learning datasets.
method Radial-Based Undersampling (RBO) using mutual class potential.
result Significantly reduced time complexity of the proposed algorithm.
Graph Convolutional Networks improve performance on complex data.
problem Processing high-dimensional, graph-based data for automation.
method Enhanced existing Graph Convolutional Network models with four improvements.
result Significant performance improvements on four benchmark datasets.
In this paper, we conduct an empirical investigation of neural query graph ranking approaches for the task of complex question answering over knowledge graphs. We experiment with six different ranking models and propose a novel self-attention based slot matching model which exploits the inherent structure of query grap…
CT improves neural network performance on cell complex data.
problem Improving predictive performance of neural networks on complex data.
method Introducing the Cellular Transformer (CT) that generalizes graph-based transformers to cell complexes.
result CT achieves state-of-the-art performance on cell complex datasets without complex enhancements.
Proposes a new method for causal inference in high-dimensional complex data.
problem Challenges in making causal inference with high-dimensional, nonlinear data.
method Combines deep learning techniques like sparse deep learning and stochastic neural networks.
result Outperforms existing methods in numerical studies.
New method uncovers global topology through local interactions, reducing algorithm complexity.
problem Global interaction is necessary for forming feature maps that preserve global topology.
method Competing agents engage in local interactions to form feature maps without global interaction.
result Local interactions can uncover global topology, leading to consistent map quality across diverse datasets.
Frugal Flows learn complex data and infer marginal causal effects.
problem Challenges in estimating marginal causal effects from complex data.
method Frugal Flows use normalizing flows to flexibly learn data and infer causal quantities.
result Frugal Flows can generate synthetic data that closely matches real-world data and exactly parameterize causal quantities.
This paper proves a generalization bound for complex-valued neural networks scaling with spectral complexity.
problem Ensuring the performance of complex-valued neural networks on unseen data.
method Theoretical derivation using Maurey Sparsification Lemma and Dudley Entropy Integral, empirical validation on various datasets.
result The spectral complexity of weight matrices is a significant factor in the generalization ability of complex-valued neural networks.
Paper presents method for generating synthetic data to evaluate GPMs in complex environments.
problem Lack of realistic scenarios and datasets to evaluate GPMs in complex environments.
method Agile knowledge representation framework to model requirements and generate synthetic ground truth data.
result Synthetic data can be generated to robustly evaluate GPMs in complex environments.
Defines complexity measure for neural networks and feature representations, revealing scaling patterns.
problem Understanding the nonlinearity and dimensionality of neural network computations and feature representations.
method Introduces complexity and effective dimension measures, investigates their dynamics during training, and analyzes their scaling properties.
result Power law scaling of complexity and effective dimension during training, revealing hidden structure of datasets.
We present an algorithm to generate synthetic datasets of tunable difficulty on classification of Morse code symbols for supervised machine learning problems, in particular, neural networks. The datasets are spatially one-dimensional and have a small number of input features, leading to high density of input informatio…
Topological parallax assesses AI models' geometric similarity to datasets for safety.
problem Ensuring AI models' robustness and safety in deep learning applications.
method Topological parallax compares a trained model to a reference dataset using Rips complexes and geodesic distortions.
result Topological parallax indicates whether a model shares similar multiscale geometric features with the dataset.
Paper introduces a new edge exchangeable block model for complex networks.
problem Limitations of the stochastic block model in analyzing complex networks.
method Develops a Bayesian nonparametric edge exchangeable block model.
result The new model outperforms state-of-the-art SBMs for link prediction.
New method speeds up Gaussian process training and inference for large datasets.
problem Training and inference in Gaussian processes are computationally expensive for large datasets.
method Iterative alternating projection method that accesses subblocks of the kernel matrix, reducing time and space complexity.
result Empirically, the method accelerates GP training and inference by up to 72x compared to conjugate gradients.
Combines geometry and topology for analyzing hierarchical datasets.
problem Analyzing complex, hierarchical datasets with irregular structures.
method Combines manifold learning and topological data analysis.
result Superior classification results compared to state-of-the-art methods.