AI techniques explain synthetic tabular data weaknesses.
problem Challenges in evaluating synthetic tabular data quality.
method Apply explainable AI to a binary detection classifier.
result Reveals inconsistencies, unrealistic dependencies, or missing patterns in synthetic data.
TabPFN-2.5 boosts tabular AI performance, especially for large datasets.
problem Improving tabular AI models for large datasets and complex feature sets.
method Advanced tabular foundation model with data augmentation and distillation techniques.
result TabPFN-2.5 outperforms tuned tree-based models and AutoGluon 1.4 on benchmark datasets.
STRIDE improves explainable AI by efficiently decomposing feature interactions without subset enumeration.
problem Lack of expressive power and high computational cost in existing XAI frameworks.
method STRIDE uses a functional decomposition approach in RKHS, avoiding subset enumeration and focusing on orthogonal components.
result STRIDE achieves a 3.0 times speedup over TreeSHAP and a high R^2 of 0.93 for feature reconstruction.
AutoDiff combines auto-encoder and diffusion model for realistic tabular data synthesis.
problem Generating realistic synthetic tabular data with heterogeneous features.
method Employing auto-encoder architecture to handle tabular data's complexity.
result Synthetic tables from AutoDiff show good statistical fidelity and perform well in machine learning tasks.
Interpretable representations improve explainable AI by translating complex data into understandable concepts.
problem Many explainers use interpretable representations but overlook their full potential and assumptions.
method An in-depth analysis of interpretable representations for tabular, image, and text data, identifying strengths, weaknesses, and desiderata.
result Linear model quantifies interpretable concepts' influence on black-box predictions, revealing their explanatory properties and manipulability.
Generative AI improves stock selection by synthesizing features from diverse data sources.
problem Automating feature discovery in stock market data.
method Used large language models with retrieval-augmented generation and structured prompting to synthesize features from various data sources.
result AI-generated features consistently outperform baselines, with Sharpe improvements ranging from 14% to 91%.
xRFM improves tabular data inference with better accuracy and scalability.
problem Inference from tabular data remains challenging and underdeveloped compared to other AI areas.
method Combines feature learning kernel machines with a tree structure.
result xRFM outperforms other methods across 100 regression and 200 classification datasets.
ProtoNAM models tabular data with neural networks, making predictions transparent.
problem Tabular data analysis using neural networks lacks transparency and accuracy compared to tree-based methods.
method ProtoNAM introduces prototypes into neural networks to model tabular data while maintaining explainability.
result ProtoNAM outperforms existing NN-based GAMs and provides insights into learned feature patterns.
AI-enhanced product embeddings boost demand analysis accuracy.
problem Traditional demand analysis struggles with nuanced product attributes.
method Combining text, images, and tabular data with transformer embeddings for causal inference.
result AI-enhanced embeddings improve sales rank and price predictions.
HyperFast instantly classifies tabular data in one pass.
problem Computational burden and time-consuming hyperparameter tuning for deep learning models.
method Meta-trained hypernetwork for instant classification.
result Significantly faster than competing methods with competitive performance.
A new method for interpreting AI models using Shapley value for functional data.
problem Interpreting AI models, especially those based on functional data.
method Proposes an interpretability method based on the Shapley value for continuous games.
result Demonstrates the effectiveness of the method through experiments with simulated and real data.
Survey of determinism issues in financial AI systems.
problem Vulnerabilities in reproducibility of financial AI systems.
method Literature review and first-party experiments on public financial datasets.
result Proposed a layered evaluation framework linking modality-specific metrics to audit readiness.
AI-assisted interviews allow respondents to describe experiences naturally, but mapping those accounts into structured survey variables is fallible.
problem Mapping AI-assisted interview responses into structured survey variables is fallible.
method Adaptive Matrix Validation (AMV) is proposed, which involves mapping responses into tabular data and using a small set of structured questions for statistical adjustment.
result The estimator calibrates mapped values using validation answers from other respondents and corrects remaining error with validation answers observed for the target respondent.
Unified AI system for data quality control and governance in regulated environments.
problem Isolated data quality control steps in existing systems.
method AI-driven framework integrating rule-based, statistical, and AI methods.
result Empirical gains in anomaly detection, reduced manual remediation, improved auditability.
Proposes a framework for generating explainable AI exemplars.
problem Need to explain decisions of complex deep learning models.
method Generative model with evolutionary strategy to synthesize exemplars.
result Framework is generic and model-agnostic for various data types.
Framework predicts melt pool geometry with AI, improving manufacturing quality.
problem Achieving consistent product quality in Metal Additive Manufacturing.
method Surprise-guided sequential learning framework integrating CTGAN for limited data.
result Enhanced predictive accuracy for melt pool dimensions.
FIVES generates high-order interactive features efficiently and effectively.
problem Automating the generation of high-order interactive features in tabular data.
method Formulates interactive feature generation as edge search on a feature graph, using a GNN and adjacency tensor.
result FIVES outperforms state-of-the-art methods in various datasets and real-world applications.
Two XAI methods, SHAP and LIME, are discussed for tabular data models.
problem Making machine learning models transparent and trustworthy.
method SHAP and LIME methods for explaining model predictions.
result SHAP and LIME are model-dependent and sensitive to feature collinearity.
New framework explains ML credit scoring models using counterfactual examples.
problem Explaining complex ML models in finance for credit scoring.
method Adversarial counterfactual examples for tabular data.
result Proposes a method to generate realistic counterfactual examples for tabular data.
DILP improves fraud detection explainability without significant performance boost.
problem Improving fraud detection explainability in machine learning.
method Differentiable Inductive Logic Programming (DILP) for fraud detection with data curation.
result DILP provides comparable results to traditional methods but lacks significant advantage.
New insights on Shapley value precision for tabular data predictions.
problem Precision of Shapley value explanations for individual observations.
method Conditional Shapley value estimation methods for tabular data.
result Shapley value explanations are less precise for outer observations.
Survey of neurosymbolic AI methods for reasoning over knowledge graphs.
problem Combining symbolic reasoning with deep learning for graph data.
method Logically-informed embedding, embedding with logical constraints, and rule learning approaches.
result A novel taxonomy for classifying neurosymbolic reasoning methods on knowledge graphs.
PRRO generates synthetic tabular data that improves SL performance and class distribution.
problem Low SL utility of synthetic data due to class imbalance and overlooked data relationships.
method Data pruning and column reordering to optimize SL utility.
result Synthetic data generated with PRRO enhances predictive performance and class distribution.
Paper introduces Native Guide for generating time series counterfactual explanations.
problem Lack of explainability for time series data in AI systems.
method Model-agnostic, instance-based counterfactual generation for time series classification.
result Native Guide produces better counterfactual explanations than benchmarks.
Green LIME reduces LIME's computational cost through optimal design of experiments.
problem Improving AI explainability in critical fields like healthcare.
method Optimal design of experiments to reduce LIME's computational cost.
result Significant reduction in computational effort of LIME.
Objective: To determine the completeness of argumentative steps necessary to conclude effectiveness of an algorithm in a sample of current ML/AI supervised learning literature. Data Sources: Papers published in the Neural Information Processing Systems (NeurIPS, née NIPS) journal where the official record showed a 2017…
Despite the recent development in the topic of explainable AI/ML for image and text data, the majority of current solutions are not suitable to explain the prediction of neural network models when the datasets are tabular and their features are in high-dimensional vectorized formats. To mitigate this limitation, theref…
ExCIR provides efficient, consistent, and scalable explainability for complex models.
problem Complex models lack transparency and require efficient, stable, and scalable explainability methods.
method ExCIR uses correlation-aware feature attribution with robust centering and groupwise aggregation.
result ExCIR delivers trustworthy agreement with global baselines and full model rankings, reduces runtime, and scales to large datasets.
PyTorch Frame simplifies multi-modal tabular learning with modular data and model handling.
problem Handling complex multi-modal tabular data in deep learning.
method A PyTorch-based framework that provides a data structure, model abstraction, and integration with external models.
result Demonstrated the effectiveness of PyTorch Frame in implementing and applying diverse tabular models to complex multi-modal tabular data.
LIMEtree offers faithful explanations for multiple classes in predictive models.
problem Generating explanations for several classes can be difficult due to conflicting evidence.
method LIMEtree uses multi-output regression trees for consistent and faithful explanations of multiple classes.
result LIMEtree provides diverse explanation types and outperforms LIME in evaluations.
MET learns tabular data representations without data augmentations.
problem Lack of effective self-supervised learning methods for tabular data.
method Reconstruction-based approach using masked encoding, with separate representations for each coordinate and adversarial reconstruction loss.
result MET achieves state-of-the-art performance on five diverse tabular datasets, improving up to 9% over current methods.
Deep tabular models outperform GBDT in medical diagnosis tasks.
problem Transfer learning for tabular data in medical diagnosis.
method Proposes a pseudo-feature method for transfer learning between different feature sets.
result Tabular neural networks outperform GBDT in medical diagnosis tasks.
GACTGAN synthesizes tabular data better with less computational overhead.
problem Synthesizing mixed tabular data while balancing risk and utility.
method Integrates Bayesian posterior approximation with Stochastic Weight Averaging-Gaussian (SWAG) in CTGAN.
result GACTGAN produces better synthetic data with reduced privacy risk.
This work tackles GAN training instability through parallel tempering.
problem Training instability and mode collapse in GANs.
method Introduces a parallel tempering framework to stabilize GAN training.
result Significantly reduces gradient variance and improves training efficiency.
Paper tackles test-time adaptation for tabular data.
problem Performance degradation due to distribution shifts in testing.
method Proposes FTAT for robustly adapting tabular models during testing.
result FTAT outperforms state-of-the-art methods on benchmark datasets.
AdapTable adapts tabular models to shifts without source data, improving HELOC performance.
problem Distribution shifts in tabular data threaten model performance.
method Shift-aware uncertainty calibrator and label distribution handler.
result Up to 16% improvement on HELOC dataset.
FinPT uses large pretrained models to predict financial risks.
problem Outdated algorithms and lack of open financial benchmarks.
method Profile Tuning on large pretrained foundation models.
result Demonstrated effectiveness on FinBench datasets.
Survey of counterfactual explanations for time series classification.
problem Generating plausible and actionable counterfactuals for time series data.
method Review of various counterfactual generation methods for time series classification.
result Highlight unique challenges and strengths of existing methods.
GOTabPFN improves tabular model performance with compact tokenization for HDLSS data.
problem Making tabular models effective for high-dimensional, low-sample size data without retraining.
method Introducing Graph-guided Ordering with Local Refinement (GO-LR) and Neuro-Inspired Subunit Compression (NSC) to create compact meta-features.
result GOTabPFN improves stability and accuracy in tabular benchmarks with compact tokenization.
Improves tabular data augmentation for contrastive learning.
problem Ineffective augmentation techniques for tabular data.
method Class-conditioned and feature-correlation based augmentation.
result Consistently outperforms conventional corruption methods.
Orion-Bix combines biaxial attention and meta-learning for tabular few-shot learning.
problem Scaling and generalizing tabular models with mixed numeric and categorical fields, weak feature structure, and limited labeled data.
method Orion-Bix uses biaxial attention and meta-learned in-context reasoning to efficiently capture local and global dependencies.
result Orion-Bix outperforms gradient-boosting baselines and state-of-the-art tabular models on public benchmarks.
Proposes a proportional masking strategy for better tabular data imputation.
problem Heterogeneity of tabular data disrupts uniform random masking in MAEs.
method Computes missingness statistics, generates proportional masks, uses MLP token mixing.
result Proportional masking preserves missingness distribution, improves imputation performance.
DNF-Net tackles tabular data challenges with neural architecture.
problem Handling tabular data efficiently using neural networks.
method DNF-Net uses a neural architecture with inductive bias corresponding to logical Boolean formulas in disjunctive normal form over affine soft-threshold decision terms.
result DNF-Net significantly outperforms fully connected networks on tabular data.
Fed-TDA augments federated tabular data to improve performance and privacy.
problem Non-IID data challenges in federated learning.
method Synthesizes tabular data using simple statistics for augmentation.
result Fed-TDA improves test performance and communication efficiency.
JoLT uses LLMs to make probabilistic predictions on tabular data.
problem Making probabilistic predictions on tabular data efficiently and without preprocessing.
method JoLT leverages LLMs' in-context learning to define joint distributions over tabular data.
result JoLT outperforms other methods on tabular classification and regression tasks.
BiSHop tackles tabular data challenges with sparse Hopfield layers.
problem Non-rotationally invariant data structure and feature sparsity in tabular data.
method Sequential column-wise and row-wise processing through interconnected directional learning modules with generalized sparse modern Hopfield layers.
result BiSHop surpasses current SOTA methods with significantly less hyperparameter tuning.
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.
The study introduces a holdout-based framework to assess synthetic data fidelity and privacy.
problem Evaluating the quality and privacy of synthetic data solutions for mixed-type tabular data.
method Holdout-based empirical assessment framework measuring fidelity and privacy risk.
result Synthetic data samples are as close to the training as to the holdout data, indicating generalization and independence from individual records.