Skip to main content
Search

Lincen Yang

2 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

    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