arXiv:2606. 24679v1 Announce Type: cross Abstract: Data preparation pipelines improve data quality in machine learning by transforming raw tables into learning-ready data through sequential cleaning and feature transformation operators.
arXiv:2509. 09960v2 Announce Type: replace-cross Abstract: Synthetic tabular data generation is increasingly essential in machine learning, supporting downstream applications when real-world, high-quality tabular data is insufficient.
The paper introduces CLEAR, a latent Flow Matching framework designed to generate visual counterfactual explanations (VCEs) that alter a classifier’s prediction while preserving realistic and decision‑irrelevant content. CLEAR addresses two main issues in latent‑space VCEs: opposing update directions between latent generation and classifier guidance, and unintended changes from VAE reconstruction. By decomposing classifier guidance into cooperative and conflicting components and selectively attenuating the conflicting part, CLEAR achieves counterfactual quality comparable to image‑space methods while being 2.5× faster.
arXiv:2610.35679v1 Announce Type: cross Abstract: In eXplainable AI, counterfactual explanations have gained significant traction by offering users direct, intuitive, and actionable insights into mod...
arXiv:2605.09424v2 Announce Type: replace Abstract: Generative modelling is a demanding test of foundation models, because it requires robust, holistic representation learning for a given data modali...
FCx is a new algorithm that generates counterfactual explanations while explicitly enforcing feasibility constraints. It uses a modified Variational Autoencoder with a multi‑factor loss to produce realistic, low‑cost counterfactuals that satisfy both hard constraints supplied by users and soft constraints inferred via causal inference. Experiments on four public datasets demonstrate that FCx matches state‑of‑the‑art performance across multiple metrics while guaranteeing feasibility.
arXiv:2605.05736v3 Announce Type: replace Abstract: Vector quantization (VQ) with autoregressive (AR) token modeling is a widely adopted and highly competitive paradigm for time-series generation. Ho...
arXiv:2610.07008v1 Announce Type: new Abstract: Few-shot class-incremental learning (FSCIL) aims to learn novel classes from limited annotations while preserving prior knowledge. Existing methods typ...
The paper introduces FlowGDA, a flow‑matching framework for gradual domain adaptation that models adaptation as continuous transport on a statistical manifold. FlowGDA learns time‑dependent velocity fields to generate smooth domain trajectories, avoiding adversarial Min–Max optimization by using a simulation‑free regression objective. The method incorporates source‑anchored transport, semantic consistency loss, and a two‑stage optimization scheme to prevent semantic drift, achieving superior performance over state‑of‑the‑art techniques.
arXiv:2602. 00797v2 Announce Type: replace-cross Abstract: Flow-based methods have achieved significant success in various generative modeling tasks, capturing nuanced details within complex data distributions.
Flow Reasoning Models (FRMs) are a new framework that turns continuous flow models into efficient recurrent reasoners for structured tasks. By self‑conditioning a flow model on its own past outputs, FRMs iteratively refine solutions, allowing parallel decision making and revision. The authors introduce Fixed‑Point Forcing (FPF) to mitigate exposure bias at deeper recursion, and report near‑perfect solve rates on Sudoku‑Extreme, Zebra, and Maze‑Unique, outperforming existing masked‑diffusion and specialized baselines while using far fewer inference FLOPs.
arXiv:2603. 16436v2 Announce Type: replace Abstract: Counterfactual explanations (CE) explain model decisions by identifying input modifications that lead to different predictions.