Searcharxiv⌕ Search

arXiv subjects

Ge Wang

Publications and source records attributed to Ge Wang.

At least 19 recordsLinked to original sources

Guidance-Coupled Nullspace Drifting for One-Step Medical Image Reconstruction

Generative reconstruction can recover high-quality images from undersampled acquisitions, but state-of-the-art generative priors commonly rely on iterative sampling. Reducing the number of iterations lowers inference cost but also removes opportunities for progressive distributional refinement, making it difficult to retain image realism without sacrificing reconstruction fidelity. Drift modeling offers an alternative by shifting progressive refinement to training, thereby enabling one-step sampling without an iterative inference trajectory. Existing drifting methods, however, do not account for the imaging operator when modeling distributional drift. We propose DriftRecon, a generative method for one-step medical image reconstruction that performs drifting directly in the nullspace of the imaging operator. DriftRecon uses nullspace-restricted noise to construct training samples and a multiscale generator that incorporates measurement conditioning across resolution levels, with its generated component projected onto the operator nullspace. To control the fidelity--realism trade-off at inference, a conditional guidance parameter continuously steers the same generator between measurement-conditioned and unconditional generation. We derive a guidance-dependent similarity-kernel temperature schedule that preserves the guidance-weighted mass receiving strengthened supervision, thereby progressively localizing drift interactions as guidance increases to limit the associated loss of reconstruction fidelity. Experiments in sparse-view CT and accelerated MRI reconstruction show that DriftRecon outperforms established generative reconstruction methods and recent drifting models while producing reconstructions in a single forward pass.

eess.IV↗

RAHF-Net: Range-Aware Heterogeneous Fusion for LiDAR-Assisted RGB Semantic Segmentation

This paper studies LiDAR-assisted RGB semantic segmentation, where LiDAR point-cloud features improve dense pixel-wise predictions in the RGB image plane rather than 3D point labels or detections. Existing 2D fusion methods often project point clouds into shallow depth/range maps and apply spatially uniform fusion, discarding rich 3D structure and ignoring the range-dependent reliability of outdoor LiDAR. We propose RAHF-Net, a Range-Aware Heterogeneous Fusion Network. Its Cylindrical-to-Perspective (C2P) module projects pretrained cylindrical voxel features into the image plane, preserving structured 3D semantic priors. A Range-Aware Heterogeneous Fusion (RAHF) module then uses a soft depth-derived range mask to perform LiDAR-guided geometric enhancement in reliable near-field regions and visual-context enhancement in sparse far-field regions. On KITTI-360, RAHF-Net achieves 65.76 mIoU, outperforming representative RGB-only and RGB-LiDAR baselines, including CMX by 1.45 points. Experiments on DELIVER further demonstrate improved robustness under adverse weather, illumination degradation, and sensor corruption.

cs.CV↗

PEEL-DDPM: Physics-Enabled Evidential Learning for the Denoising Diffusion Probabilistic Model

Normal-inverse-gamma (NIG) regression is not identifiable from its marginal Student-t likelihood: three combinations of four NIG parameters are determined, leaving one degree of freedom. We introduce PEEL-DDPM, a physics-enabled evidential learning framework for denoising diffusion probabilistic models. A measurement-conditioned DDPM is first trained with epsilon-MSE and then frozen. Its complete reverse trajectory produces a reconstruction, whose residual from the known training object is modeled by a final-image evidential network. The network learns only the identifiable Student-t coordinates, while repeated scanner-noise realizations and repeated diffusion trajectories provide a nested Monte Carlo estimate of final-image aleatoric variance, separated into scanner-induced and sampler-induced components. This measured variance resolves the remaining NIG ambiguity and yields a decomposition of predictive uncertainty into measurement, diffusion, and epistemic terms. The method uses sequential training without a cross-loss weighting coefficient. In a feasibility study on eight held-out objects, empirical central-interval coverages were 49.3%, 80.3%, 90.1%, and 95.6% for nominal 50%, 80%, 90%, and 95% intervals. The mean squared residual was 0.967 times the mean predicted variance, and a single-image aleatoric head achieved pooled Spearman correlation 0.785 against an independent nested reference. Across five dose levels, scanner-induced variance showed a log-log dose slope of -1.15, whereas sampler-induced variance remained nearly dose independent with slope -0.01. These results support PEEL-DDPM as a practical route to identifiable and physically interpretable uncertainty quantification in diffusion-based image reconstruction.

cs.CV↗

Combinatorial Network-Based Manifold Topological Deep Learning for Image Analysis

Medical image analysis remains fundamentally challenging because of the intricate geometric and topological structures present in medical data. Conventional convolutional neural networks model images as regular Euclidean grids, limiting their ability to preserve geometric relationships and higher-order structural information. Recently, manifold topological deep learning (MTDL) has emerged as a promising paradigm that integrates deep learning with geometric and topological representations. Nevertheless, existing methods have not yet fully exploited discrete manifold structures within combinatorial complex neural networks. To bridge this gap, we introduce CNMTDL, a MTDL framework that integrates Hodge decomposition with a combinatorial attention mechanism. In our approach, medical images are represented as discrete manifolds and decomposed into three Hodge components. Features extracted from these components are concatenated and embedded into a combinatorial complex architecture, enabling enhanced higher-order message passing between $0$-cells and $2$-cells through attention-based blocks. We evaluate CNMTDL on six two-dimensional and three-dimensional datasets from the MedMNIST v2 benchmark, demonstrating its effectiveness for medical image analysis.

cs.CV↗

Learner-Centered Design of Educational Tools for Cross-Expertise Technical Communication in Computing Contexts

Cross-expertise technical communication (i.e., communicating about computing topics across levels of computing expertise) is important for workplace collaboration. However, students are underprepared because computing education rarely explicitly teaches communication, and available practice tends to occur among peers with similar expertise. We take a learner-centered design approach to inform technologies for developing these skills. We interviewed 12 industry professionals and conducted focus group and co-design sessions with 14 college students preparing for computing-related roles. Professionals emphasized adapting communication, negotiating expectations, building shared understanding, and using multiple modalities and artifacts. Students anticipated challenges adapting communication, navigating unfamiliar workplace dynamics, and communicating under fear of judgment, and valued rich, realistic practice environments that preserved their psychological safety. Synthesizing professional and learner perspectives with educational theory, we conclude that building self-efficacy through authentic mastery experiences and changing attitudes related to help-seeking are critical elements for educational technology design in this context.

cs.HC↗

MaskVLA: Visual Masking Against Trajectory Overfitting of Vision-Language-Action Model

Vision-Language-Action (VLA) models integrate vision-language understanding with executable robot actions, enabling end-to-end learning for robot control. However, our empirical analysis reveals that existing models exhibit severe trajectory overfitting when finetuned on limited datasets. To guide the model in effectively utilizing wrist camera information, we propose MaskVLA, a masking-based fine-tuning strategy. By randomly masking a small portion of the main camera's visual information, the model is guided to autonomously learn more fine-grained, task-relevant, and effective visual features. This process leads to the emergence of robust policies, thereby enhancing the model's capability to tackle complex manipulation tasks and improving its generalization performance. Our method has been comprehensively evaluated on RoboTwin 2.0, achieving an average success rate improvement of 23.2% and 16.8% compared to $π_0$ and OpenVLA-OFT, respectively. Furthermore, experiments on real-world ALOHA robots also demonstrate the effectiveness of our approach.

cs.CV↗

A discrete generative model of neuronal spiking activity on microelectrode arrays

Generative models of neural activity could help characterize tissue dynamics, compare experimental conditions, and simulate population activity for applications ranging from disease and drug-response studies to closed-loop experimentation. Existing approaches, however, typically assume a fixed set of sorted neurons, whereas high-density microelectrode arrays produce extremely sparse, array-wide binary spike volumes in which the observed subset of electrodes varies across assays. We introduce a discrete generative model that represents this activity using a shared vocabulary of spatiotemporal motifs. A residual vector-quantized autoencoder learns the motif vocabulary, while a factorized masked transformer predicts where activity occurs and which motif appears at each active location. We evaluate the model on 31 assays spanning human brain organoids and acute \emph{ex vivo} human hippocampal tissue. The learned motifs are broadly reused: assay identity explains only $9%$ of the entropy in motif use, and motif overlap across tissue types is comparable to overlap within them. When representation quality is evaluated independently of the generative prior, our approach achieves $5.2\times$ the voxel-level reconstruction average precision of a matched flat tokenizer. For masked completion and free generation, the full model achieves $1.4$--$2.6\times$ the site-level average precision of the matched generative baseline and outperforms it across all four families of generation metrics. These results establish a compact, reusable representation for array-wide spiking activity without learned assay-specific parameters, providing a scalable foundation for generative modeling across diverse neural preparations.

cs.LG↗

PSEE: Progressive Sensor Event Expansion for Point-Supervised Temporal Action Localization

Temporal action localization (TAL) in wearable sensor streams identifies action classes and temporal boundaries, enabling finer-grained activity understanding than conventional action recognition. However, training typically requires costly start--end annotations for every action instance. To reduce this burden, we study point-supervised TAL, where each instance is labeled with only one timestamp and its class. We propose Progressive Sensor Event Expansion (PSEE), which combines semantic activations, sensor-specific transition evidence, and adaptive temporal ownership to recover point-supervised pseudo segments. These segments supervise standard TAL detectors without modifying their inference procedures. Cross-subject experiments on four inertial-sensing benchmarks demonstrate improved pseudo-boundary quality over adapted point-supervised baselines, compatibility with different TAL detectors, and robustness to point sampling. Code is available at https://github.com/joeeeeyin/PSEE.

cs.CV↗

Designing Computerized Gait Analysis for Pediatric Care: Clinician Perspectives on Sensing, Workflow, and Care Environments

Computerized gait analysis (CGA) is a diagnostic tool for various disorders in children, enabling objective assessment of movement for clinical interventions. Existing work on pediatric CGA has focused on technical/clinical performance, leaving less understood about how clinicians interact with these systems in practice. We interviewed 12 pediatric clinicians and one system designer experienced with CGA. Participants described mismatches between CGA and pediatric care, including children's sensory sensitivities to wearables, difficulties placing sensors on child-sized bodies, and challenges with engagement during data collection. These mismatches required clinicians to adapt procedures to children's bodies, behaviors, and needs. Clinicians highlighted opportunities to extend CGA into environments such as playgrounds, where children's movement could be assessed in contexts relevant to their development. Based on these insights, we offer design implications for pediatric CGA, including designing sensing and calibration for smaller and changing bodies. Our study informs clinical technologies that account for pediatric needs.

cs.HC↗

Visual Analysis of LLM-based Entity Resolution from Scientific Papers

This paper focuses on the visual analytics support for extracting domain-specific entity from extensive scientific literature, a task with inherent limitations using traditional named entity resolution methods. With the advent of large language models (LLMs) such as GPT-4, significant improvements over conventional machine learning approaches have been achieved due to LLM's capability on entity resolution integrate abilities such as understanding multiple types of text. This research introduces a new visual analysis pipeline that integrates these advanced LLMs with versatile visualization and interaction designs to support batch entity resolution. Specifically, we focus on a specific material science field of Metal-Organic Frameworks (MOFs) and a large data collection namely CSD-MOFs. Through collaboration with domain experts in material science, we obtain well-labeled synthesis paragraphs. We propose human-in-the-loop refinement over the entity resolution process using visual analytics techniques, which allows domain experts to interactively integrate insights into LLM intelligence, including error analysis and interpretation of the retrieval-augmented generation (RAG) algorithm. Our evaluation through the case study of example selection for RAG demonstrates that this human-machine collaborative approach improved single-document entity resolution accuracy by approximately 30%.

cs.IR↗

Unified Deployment-Aware Evaluation of Open Reasoning Language Models

Open reasoning language models are often compared under mixed sample sizes, partially standardized prompts, and accuracy-centered summaries, which makes practical model selection difficult to interpret. We present a unified evaluation of seven open reasoning language model configurations across four benchmarks: ARC-Challenge, GSM8K, MATH levels 1 to 3, and TruthfulQA MC1. We test zero-shot, chain-of-thought (CoT), and few-shot CoT prompting on the same 238-example subset for every model--dataset--strategy condition, yielding a complete 7 x 4 x 3 design with 84 conditions and 19,992 evaluated examples. Beyond accuracy, we report Wilson confidence intervals, latency, peak video random access memory (VRAM), weighted aggregate performance, Pareto-efficient operating points, prompt-sensitivity metrics, and compatibility diagnostics. Gemma-4-26B-A4B with zero-shot prompting achieves the highest weighted score at 0.794. Gemma-4-E4B remains close to the top across prompting settings while using substantially lower latency and memory, making it a strong practical operating point. Bootstrap and paired-permutation analyses show that the leading configurations are close enough that deployment tradeoffs remain important. We also find that prompting strategy changes model rankings rather than shifting all models uniformly. Benchmark-specific complementarity creates routing headroom, with an oracle task-aware selector reaching a weighted score of 0.825. Compatibility diagnostics show that some apparent failures, especially Phi-4-Reasoning on GSM8K, reflect robustness and interface-adherence problems under the shared evaluation pipeline. These results support a central claim: open-model evaluation should be framed as a deployment-aware, multi-objective operating-point problem rather than as a single-score leaderboard exercise.

cs.CL↗

Evaluating the Hidden Costs of Personalization in Large Language Models

While Large language models (LLMs) incorporate user personalization signals to improve usability and helpfulness, they increasingly shift from providing balanced, informative responses toward optimizing for user satisfaction when conditioned on personal context such as conversation history, inferred preferences, and user profiles. Specifically, we identify three emerging risks: (1) irrelevant personalization, where models reference personal information in unnecessary contexts; (2) preference narrowing, where models reinforce informational echo chambers; and (3) sycophantic bias, where models agree excessively with user opinions. As a result, models may reference personal information in contexts where it is unnecessary, inadvertently collapse response diversity, or agree excessively with user opinions. Despite the growing use of personalization in AI assistants, there has been limited systematic evaluation of its potential side effects. To bridge this gap, we propose PRISK, a dynamic evaluation framework with automated data generation and tailored metrics that uncovers systematic limitations in current LLM personalization and how personalized information shapes its responses. Our empirical analysis across 13 LLMs demonstrates the presence of user profiles and retrieved memories consistently exacerbates biases, resulting in an average drop of 45.9% in irrelevant personalization, 41.7% in preference narrowing and 61.7% in sycophantic bias.

cs.AI↗

PEEL: Physics-Enabled Evidential Learning for Identifiable Uncertainty in CT Imaging

Normal-inverse-gamma (NIG) regression is not uniquely identifiable from its marginal Student-t likelihood: the likelihood determines three combinations of four NIG parameters and is constant along a one-dimensional fiber. We identify that fiber using independent physical measurement. As an initial embodiment, a reconstruction network receives one noisy filtered-backprojection (FBP) image and is first trained only by Student-t negative log-likelihood to estimate the three identifiable coordinates (gamma, alpha, c). The network is then frozen; repeated physical-noise realizations propagated through its reconstruction output form a Monte Carlo (MC) teacher label for output-domain aleatoric variance. An aleatoric head attached to frozen features learns this label, after which (beta, nu) are recovered algebraically. On 30 held-out simulated objects at five photon levels, one-image predictions achieved pooled Spearman correlations of 0.832-0.951 against independent 400-repeat references, median within-image correlations were 0.834-0.947, and 98.81-99.55% of evaluated pixels satisfied the algebraic admissibility condition. The method needs no KL term, reference prior, evidence regularizer, or cross-loss weight.

cs.AI↗

ELVAE: Evidential Learning-Based Variational Autoencoder for Uncertainty-Aware Generation

ELVAE places an input-dependent normal--inverse-gamma (NIG) hierarchy at each VAE latent coordinate, separating location uncertainty $u_{\mathrm{epi}}=β/[ν(α-1)]$ from conditional variability $u_{\mathrm{var}}=β/(α-1)$. The marginalized latent law, however, identifies only the three quotient coordinates $(γ,α,c)$ with $c=β(1+1/ν)$; reconstruction is blind to one $(ν,β)$ fiber direction. A companion theoretical analysis shows that the complete NIG prior and forward KL select a unique prior-relative canonical representative on each fiber, so canonical inverse allocation is not a fourth independent information channel. Empirically, trained inverse evidence $1/ν$ remains the strongest sensitivity-ranking score. At $τ_{\mathrm{epi}}=1$, the three-seed mean high/low-$u_{\mathrm{epi}}$ semantic-transition ratios are 1.98 on MNIST and 1.66 on Fashion-MNIST, falling to 1.33 and 1.16 under scale-matched controls. In the 20-draw MNIST component study with equal per-anchor perturbation energy, $1/ν$ gives high/low ratios 1.69 and 1.65 under the $u_{\mathrm{epi}}$ and $u_{\mathrm{var}}$ fields and 1.69 (95\% interval 1.45--1.97) under a geometry-free isotropic field, whereas $u_{\mathrm{var}}$ reverses the isotropic ordering to 0.76. Under the experimental prior, canonical $1/ν_{\mathrm{can}}$ is a strictly increasing transform of $T=c/[α(γ^2+2)]$ and is bounded above by $3+\sqrt{10}$. Thus ELVAE exposes a controllable sensitivity mechanism whose trained four-output realization is operationally informative, while the exact reconstruction-visible information remains three-dimensional and baseline image quality is a separate question.

cs.LG↗

FORCE-Interior: Measurement-Consistent Adaptation of a Poisson-Flow Generative Prior for Interior CT

Interior tomography reconstructs a region of interest (ROI) from truncated projections, an ill-posed problem with non-unique solutions and truncation-induced bias. Existing deep-learning methods can be sensitive to changes in ROI geometry and noise, while expressive generative priors may produce measurement-inconsistent content without measurement constraints. We propose FORCE-Interior, a training-free adaptation of a pretrained Poisson-flow generative prior to interior CT. A full-field-of-view (FOV) OS-SART warm start avoids forcing all measured attenuation into the ROI, and truncation-mask-aware OS-SART updates enforce data consistency throughout sampling. In our experiment, FORCE-Interior achieves the best PSNR, SSIM, and LPIPS at the two more severely truncated synthetic ROI sizes and competitive performance at the largest ROI, while maintaining low projection-domain residuals. These findings support the measurement-consistent adaptation of a reusable generative CT prior, while further clinical and patient-level validation remains necessary.

eess.IV↗

Theoretical Study on the Evidential Learning-based Variational Autoencoder

A normal--inverse-gamma (NIG) latent hierarchy has four parameters, but its induced latent law does not identify all four. For $σ^2\sim\mathrm{InvGamma}(α,β)$, $μ\midσ^2\sim\mathcal{N}(γ,σ^2/ν)$, and $z\midμ,σ^2\sim\mathcal{N}(μ,σ^2)$, the marginal law of $z$ depends on $(ν,β)$ only through $c=β(1+1/ν)$. Hence the reconstruction-visible parameter space is the three-dimensional quotient $(γ,α,c)$, with a one-dimensional fiber degree of freedom. For a fixed hierarchical variational objective, exact partial minimization of the forward KL divergence to a complete NIG prior selects a unique prior-relative representative on each fiber, yielding an exact three-coordinate reduction with the same optimum as the four-coordinate objective. Writing $ρ_0=2β_0/ν_0$ and $T=c/\{α[(γ-γ_0)^2+ρ_0]\}$, we show that inverse canonical allocation $1/ν_{\rm can}$ is an explicit strictly increasing function of $T$. For $α>1$, the ratio $u_{\rm epi}/u_{\rm var}=1/ν_{\rm can}$ is therefore determined by the quotient state and prior; for rank-only use under a common calibration, $T$ contains the same coordinatewise ordinal information. The residual prior gauge is characterized rather than eliminated: $(γ_0,ρ_0)$ govern ordinal dependence, while $(ν_0,α_0)$ determine numerical calibration and the analytic ceiling of $1/ν_{\rm can}$.

stat.ML↗

Decoupling Is Not Identification: Supervised Evidential Learning in Next-Token Prediction

A next-token probability says what a model predicts, not how much training support lies behind it. A Dirichlet head can represent this distinction by separating mean $m$ from concentration $S$, but decoupling does not identify what $S$ means. Here we propose an Evidential Next-Token Prediction (ENTOP) framework to audit this gap on character-level Moby-Dick, using exact 8-gram count as a reproducible lexical-support label and withholding count regression from 20% of context types. Standard implicit evidential training carries essentially no count signal beyond confidence on held-out-label types (partial Spearman $ρ= 0.001 \pm 0.014$), whereas explicit supervision generalizes ($ρ= 0.201 \pm 0.010$; matched-pair win $= 0.822 \pm 0.021$). CE predictive entropy is at chance for unseen 8-grams (AUROC $= 0.490 \pm 0.004$), while supervised vacuity reaches $0.772 \pm 0.003$, comparable with an indexed CE-representation baseline ($0.769$) but below the tautological corpus oracle ($1.000$). Neither longest-suffix nor representation-distance strata explain where amortization succeeds. Increasing count weight under the digamma objective improves support fit only by sacrificing prediction. A constant predictor wins natural log-RMSE, and vacuity does not improve error deferral. These results motivate a minimum evidence protocol---confidence control, matched pairs, held-out labels, a constant baseline, and a decision test---and show that concentration can pass identification while failing calibration and utility.

cs.AI↗

Evaluation of Silicon-Based Photon-Counting CT for Coronary Stenosis Quantification with Realistic Coronary Artery Phantoms

Objective: To quantify the impact of high-resolution deep silicon photon-counting CT (dSi-PCCT) on coronary stenosis quantification in anatomically realistic calcified coronary artery phantoms using Micro-CT as ground truth. Methods: Twelve vessel sections representing four calcification geometries (Type I-IV) and three luminal iodine concentrations (10, 15, and 20 mg/mL) were scanned under static conditions using energy-integrating detector CT (EID-CT), dSi-PCCT, and Micro-CT. Images were registered to Micro-CT and segmented using an automated threshold-based pipeline. The primary analysis compared longitudinal profiles of Micro-CT-referenced percent area stenosis and segmented vessel area. A secondary analysis evaluated ellipse-derived percent area stenosis and percent vessel-area deviation at the maximum-calcification cross-section. Results: dSi-PCCT reduced whole-profile mean absolute error in Micro-CT-referenced percent area stenosis from 3.10% with EID-CT to 1.62% (p=0.027) and reduced segmented vessel-area error from 0.55 to 0.31 mm2 (p=0.001). In the secondary analysis, absolute deviations in ellipse-derived percent area stenosis ranged from 0.1% to 6.5% for dSi-PCCT and from 0.8% to 24.2% for EID-CT (p<0.001). Mean absolute differences in percent vessel-area deviation from Micro-CT were also lower with dSi-PCCT than with EID-CT (15.0% vs 26.6%, p<0.001). Conclusion: Under static, resolution-optimized conditions, dSi-PCCT improved task-based coronary stenosis quantification and vessel delineation relative to EID-CT, supporting further evaluation in dynamic phantoms and clinical CCTA.

physics.med-ph↗