Skip to main content
Search

Great Bay University

4 related articles

Subscribe to updates
  1. arXiv

    Subgroup discovery stops folding support into one score: AtomSD returns the most deviating subgroup at any support threshold

    Subgroup discovery has long compressed deviation and coverage into a single weighted score, so a user-specified minimum support often has no matching most-deviating subgroup. AtomSD recasts the search as selecting among a finite set of homogeneous regions, called atoms: in theory the optimal subgroup at every support threshold is a union of whole atoms plus at most one partial atom. On 19 UCI benchmark datasets it reaches an average rank of 1.25 across five support thresholds and is best in 78 of 95 dataset-threshold combinations, and it improves subgroups returned by four existing methods when used as post-processing.

  2. arXiv

    LLMs quietly flip constraints when they write optimization models: post-hoc repair lifts zero-shot accuracy from 44.8% to 64.9% without retraining the generator

    OPT-Kraken treats an LLM's optimization model and solver code as frozen artifacts and repairs them after the fact, lifting zero-shot accuracy from 44.8% to 64.9% across six benchmarks while making only 0.6% of initially correct outputs incorrect.

  3. AI4Math review: from guiding conjectures to formal proofs, AI now solves PKU graduate exams and verifies Erdős counterexamples in Lean

    This review systematically surveys the progress, challenges, and prospects of AI for Mathematics (AI4Math), organizing the field into problem-specific modeling (guiding intuition, constructing counterexamples, formal reasoning in closed systems) and general-purpose modeling (natural language reasoning, formal reasoning, mathematical information retrieval), and reports the authors' own PKU undergraduate and PhD qualifying exam evaluations: GPT-4 averages below 60 while reasoning-enhanced models such as o1, DeepSeek-R1, o3-mini, and Gemini 2.5 Pro mostly exceed 90, with o3-mini averaging 84.4 on 58 PhD qualifying exam problems, while research-level mathematics remains an open challenge.

  4. arXiv

    Flow matching for sparse-view CT reconstruction: reusing velocity fields cuts network evaluations to 7 while matching diffusion-model quality

    The authors propose FMCT, the first flow-matching-based CT reconstruction framework, and an efficient variant EFMCT that reuses previously predicted velocity fields over consecutive steps to cut neural network function evaluations (NFEs), motivated by the deterministic ODE sampling of flow matching being naturally compatible with repeated data consistency corrections and by the strong correlation of predicted velocities across adjacent steps; they provide a theoretical analysis showing the reuse error is of the same order as Euler discretization and bounded for a bounded number of consecutive reuse steps, and on the AAPM and Medical Segmentation Decathlon CT datasets with 20-view and 40-view parallel-beam sparse sampling, FMCT/EFMCT achieve PSNR/SSIM competitive with diffusion-based method

You’re all caught up