arXiv subjects

Chan Hsu

Publications and source records attributed to Chan Hsu.

14 recordsLinked to original sources

arXiv2026

Silicon Sampling via Cross-Survey Transfer

Silicon sampling-using large language models (LLMs) to simulate human survey respondents-has emerged as a promising approach for augmenting traditional survey research. However, most evaluations rely on distributional comparisons rather than individual-level prediction, which risks conflating pattern matching with coherent respondent-level prediction. We propose cross-survey transfer, a more rigorous evaluation framework in which an LLM is given a respondent's answers to one set of questions and must predict their answers to entirely different questions from the same survey. Using data from the Taiwan Election and Democratization Study (TEDS) 2024, three open-weight LLMs (27B-120B parameters), and supervised machine learning baselines, we find that: (1) zero-shot LLMs achieve 52% accuracy on genuinely unseen items, closing to within 6 percentage points (pp) of a supervised random forest trained on same-population data; (2) a stable construct predictability hierarchy emerges, from 67% for partisan attitudes to 23% for sovereignty; and (3) variance collapse and safety alignment effects-two commonly cited LLM limitations-turn out to be more nuanced than previously reported, with variance collapse affecting supervised models as well and alignment effects varying dramatically across model families. These findings clarify both the promise and boundaries of silicon sampling.

cs.AI↗

arXiv2026

ADVENT: LLM-Driven Automatic Predicate Invention for ILP

Predicate invention (PI), the creation of new predicates to extend the hypothesis space, remains a critical bottleneck in Inductive Logic Programming (ILP). Existing methods rely on domain expertise and produce semantically opaque predicates, hindering adaptation to unfamiliar domains and cross-task reuse. We present ADVENT, an LLM-driven PI mechanism for ILP. ADVENT pairs LLM abductive generation with Prolog deductive verification, forming an iterative loop in which concrete execution results guide the LLM to refine candidate predicates. The mechanism leverages Large Language Models to identify implicit patterns in structured relational data and invent auxiliary predicates with meaningful names and definitions. Invented predicates and learned rules accumulate in a knowledge pool for cross-task reuse. Experiments on nine poker-hand concepts across seven LLMs show that LLM-driven PI achieves 58% success rate where ILP alone fails entirely, formal verification raises this to 80%, and the knowledge pool yields gains up to +31 percentage points, while producing human-interpretable rules. These results suggest that ADVENT offers a promising direction for automating predicate invention and enabling cross-task knowledge reuse in ILP.

cs.LO↗

arXiv2026

ForEx: A Formal Verification Framework for Explainable Reasoning in Logical Fallacy Detection and Annotation

Current evaluations of Large Language Models (LLMs) on logical fallacy detection focus on predicted labels, but do not establish whether those labels are supported by the reasoning the models provide. We propose ForEx (Formal Verification for Explainable Reasoning), a framework that translates LLM-generated explanations into Lean4 and verifies whether the translated rationale is derivable under encoded premises, not the logical validity of the original natural language argument. To distinguish prediction outcomes from the formal status of the supporting reasoning, we introduce the LLM Argument Verification Matrix, which separates label consistency from formal verification status. Experiments on LOGIC-Climate show that over 90% of LLM outputs can be translated into formal reasoning chains that pass verification, while agreement with human annotations remains around 20%. These results expose a systematic gap between formal derivability and label agreement, a distinction invisible to prediction-based metrics. ForEx moves LLM evaluation beyond label correctness toward machine-checkable analysis of formalized reasoning chains.

cs.AI↗

arXiv2026

Latent Confidence Alignment for LLM Self-Assessment

Confidence calibration in large language models (LLMs) is commonly evaluated by comparing predicted confidence with observed accuracy. However, such approaches do not model item difficulty, making it difficult to interpret discrepancies and to determine whether model confidence reflects genuine self-assessment or is merely a byproduct of the response generation process. To address this, we adopt a Rasch model-based latent ability framework and a metacognitive perspective, and propose Latent Confidence Alignment Error (LCAE) to measure the consistency between model self-assessment and the latent error probability implied by model ability and item difficulty. We further incorporate item difficulty as an external signal with a reasoning mechanism. Experiments on a medical-domain dataset with 20 models show that the proposed approach improves self-assessment quality without affecting model ability, and reveals an association between reliability and inference cost.

cs.CY↗

arXiv2025

LLM-based Agents for Automated Confounder Discovery and Subgroup Analysis in Causal Inference

Estimating individualized treatment effects from observational data presents a persistent challenge due to unmeasured confounding and structural bias. Causal Machine Learning (causal ML) methods, such as causal trees and doubly robust estimators, provide tools for estimating conditional average treatment effects. These methods have limited effectiveness in complex real-world environments due to the presence of latent confounders or those described in unstructured formats. Moreover, reliance on domain experts for confounder identification and rule interpretation introduces high annotation cost and scalability concerns. In this work, we proposed Large Language Model-based agents for automated confounder discovery and subgroup analysis that integrate agents into the causal ML pipeline to simulate domain expertise. Our framework systematically performs subgroup identification and confounding structure discovery by leveraging the reasoning capabilities of LLM-based agents, which reduces human dependency while preserving interpretability. Experiments on real-world medical datasets show that our proposed approach enhances treatment effect estimation robustness by narrowing confidence intervals and uncovering unrecognized confounding biases. Our findings suggest that LLM-based agents offer a promising path toward scalable, trustworthy, and semantically aware causal inference.

cs.LG↗

arXiv2025

Towards Simulating Social Influence Dynamics with LLM-based Multi-agents

Recent advancements in Large Language Models offer promising capabilities to simulate complex human social interactions. We investigate whether LLM-based multi-agent simulations can reproduce core human social dynamics observed in online forums. We evaluate conformity dynamics, group polarization, and fragmentation across different model scales and reasoning capabilities using a structured simulation framework. Our findings indicate that smaller models exhibit higher conformity rates, whereas models optimized for reasoning are more resistant to social influence.

cs.MA↗

arXiv2025

CodEv: An Automated Grading Framework Leveraging Large Language Models for Consistent and Constructive Feedback

Grading programming assignments is crucial for guiding students to improve their programming skills and coding styles. This study presents an automated grading framework, CodEv, which leverages Large Language Models (LLMs) to provide consistent and constructive feedback. We incorporate Chain of Thought (CoT) prompting techniques to enhance the reasoning capabilities of LLMs and ensure that the grading is aligned with human evaluation. Our framework also integrates LLM ensembles to improve the accuracy and consistency of scores, along with agreement tests to deliver reliable feedback and code review comments. The results demonstrate that the framework can yield grading results comparable to human evaluators, by using smaller LLMs. Evaluation and consistency tests of the LLMs further validate our approach, confirming the reliability of the generated scores and feedback.

cs.CY↗

arXiv2024

Understanding eGFR Trajectories and Kidney Function Decline via Large Multimodal Models

The estimated Glomerular Filtration Rate (eGFR) is an essential indicator of kidney function in clinical practice. Although traditional equations and Machine Learning (ML) models using clinical and laboratory data can estimate eGFR, accurately predicting future eGFR levels remains a significant challenge for nephrologists and ML researchers. Recent advances demonstrate that Large Language Models (LLMs) and Large Multimodal Models (LMMs) can serve as robust foundation models for diverse applications. This study investigates the potential of LMMs to predict future eGFR levels with a dataset consisting of laboratory and clinical values from 50 patients. By integrating various prompting techniques and ensembles of LMMs, our findings suggest that these models, when combined with precise prompts and visual representations of eGFR trajectories, offer predictive performance comparable to existing ML models. This research extends the application of foundation models and suggests avenues for future studies to harness these models in addressing complex medical forecasting challenges.

cs.LG↗

arXiv2024

Causal Rule Forest: Toward Interpretable and Precise Treatment Effect Estimation

Understanding and inferencing Heterogeneous Treatment Effects (HTE) and Conditional Average Treatment Effects (CATE) are vital for developing personalized treatment recommendations. Many state-of-the-art approaches achieve inspiring performance in estimating HTE on benchmark datasets or simulation studies. However, the indirect predicting manner and complex model architecture reduce the interpretability of these approaches. To mitigate the gap between predictive performance and heterogeneity interpretability, we introduce the Causal Rule Forest (CRF), a novel approach to learning hidden patterns from data and transforming the patterns into interpretable multi-level Boolean rules. By training the other interpretable causal inference models with data representation learned by CRF, we can reduce the predictive errors of these models in estimating HTE and CATE, while keeping their interpretability for identifying subgroups that a treatment is more effective. Our experiments underscore the potential of CRF to advance personalized interventions and policies, paving the way for future research to enhance its scalability and application across complex causal inference challenges.

cs.LG↗

arXiv2024

Subgroup Analysis via Model-based Rule Forest

Machine learning models are often criticized for their black-box nature, raising concerns about their applicability in critical decision-making scenarios. Consequently, there is a growing demand for interpretable models in such contexts. In this study, we introduce Model-based Deep Rule Forests (mobDRF), an interpretable representation learning algorithm designed to extract transparent models from data. By leveraging IF-THEN rules with multi-level logic expressions, mobDRF enhances the interpretability of existing models without compromising accuracy. We apply mobDRF to identify key risk factors for cognitive decline in an elderly population, demonstrating its effectiveness in subgroup analysis and local model optimization. Our method offers a promising solution for developing trustworthy and interpretable machine learning models, particularly valuable in fields like healthcare, where understanding differential effects across patient subgroups can lead to more personalized and effective treatments.

cs.LG↗

arXiv2024

Efficient Detection of Preparing Quantum Remote States Using Coherence Quantum Benefits

A sender can prepare a quantum state for a remote receiver using preshared entangled pairs, only the sender's single-qubit measurement, and the receiver's simple correction informed by the sender. It provides resource-efficient advantages over quantum teleportation for quantum information. Here, we propose the most efficient approach to detect the remote state preparation (RSP) based on the quantum benefits powered by quantum coherence's static resources of the shared pairs and the dynamic resources both the RSP participants input. It requires only the receiver's minimum of one additional coherence creation operation to verify RSP. Experimentally, we implement the introduced RSP assessment using different photon pair states generated from a high-quality polarization Sagnac interferometer, confirming the necessary and sufficient role played by the static and dynamic quantum coherence resources and demonstrating efficient RSP verification. Our results provide a route to efficiently assess RSP in practical scenarios such as quantum information in quantum networks.

quant-ph↗

arXiv2023

Toward Transparent Sequence Models with Model-Based Tree Markov Model

In this study, we address the interpretability issue in complex, black-box Machine Learning models applied to sequence data. We introduce the Model-Based tree Hidden Semi-Markov Model (MOB-HSMM), an inherently interpretable model aimed at detecting high mortality risk events and discovering hidden patterns associated with the mortality risk in Intensive Care Units (ICU). This model leverages knowledge distilled from Deep Neural Networks (DNN) to enhance predictive performance while offering clear explanations. Our experimental results indicate the improved performance of Model-Based trees (MOB trees) via employing LSTM for learning sequential patterns, which are then transferred to MOB trees. Integrating MOB trees with the Hidden Semi-Markov Model (HSMM) in the MOB-HSMM enables uncovering potential and explainable sequences using available information.

cs.LG↗

arXiv2022

Photonic non-Markovianity identification by quantum process capabilities of non-CP processes

A Markovian quantum process can be arbitrarily divided into two or more legitimate completely-positive (CP) subprocesses. When at least one non-CP process exists among the divided processes, the dynamics is considered non-Markovian. However, how to utilize minimum experimental efforts, without examining all process input states and using entanglement resources, to identify or measure non-Markovianity is still being determined. Herein, we propose a method to quantify non-CP processes for identifying and measuring non-Markovianity without the burden of state optimization and entanglement. This relies on the non-CP processes as new quantum process capabilities and can be systematically implemented by quantum process tomography. We additionally provide an approach for witnessing non-Markovianity by analyzing at least four system states without process tomography. We faithfully demonstrate that our method can be explicitly implemented using all-optical setups and applied to identify the non-Markovianity of single-photon and two-photon dynamics in birefringent crystals. Our results can also be used to explore non-Markovianity in other dynamical systems where process or state tomography is implementable.

quant-ph↗

arXiv2022

Preparing Remote States for Genuine Quantum Networks

Quantum networks typically comprise quantum channels, repeaters, and end nodes. Remote state preparation (RSP) allows one end node to prepare the states of the other end nodes remotely. While quantum discord has recently been recognized as necessary for RSP, it does not guarantee the practical implementation of RSP in quantum networks surpasses any classical method. Herein, we theoretically introduce and experimentally study a quantum resource that we call the RSP capability. This resource validates all the static and dynamic elements required to enable genuine quantum networks where the RSP's implementation can outperform any classical emulation of entanglement- and qubit-unitaries-free strategies, including the static resources of Einstein-Podolsky-Rosen pairs and the dynamic resources of quantum channels and repeaters. Our experiment measures the RSP capability to demonstrate the transition between classical and nonclassical RSP depending on the photon-pair qualities. It shows that quantum discord does not confirm a nonclassical RSP, but the RSP capability does. These results help reveal the quantum advantages that emerge when networking RSP is in play.

quant-ph↗