Author
Guan-Yuan Chen
Recent research
- AI & ComputingOpen access
Which Interference Does 4-Bit Weight Quantization Harm? It Depends on the Operating Point
Language models are commonly served with 4-bit weights, and the format is chosen on perplexity and benchmark averages, which do not vary how strongly the context competes with the answer. A quantized model that fails to resolve such interference can answer fluently with the compe...
- Society & EconomicsOpen access
Adaptive testing is entering language-model evaluation as an efficiency device, and its low item exposure is offered as incidental contamination protection (Li et al., 2026b). That argument assumes untargeted leakage, yet a maximum-information test asks predictable items that any...
- Health & MedicineOpen access
Background and objective: Telemedicine assesses voice from recordings sent over telephone and video links, where lossy speech codecs commonly sit between the voice and the screening model, and clinicians act on each patient’s flag. Codec studies report aggregate accuracy, yet two...
- AI & ComputingOpen access
Accuracy-Matched Is Not Cost-Matched: Pricing and Repairing Token Inflation in INT4 Reasoning Models
INT4 weight quantization is accepted for a reasoning model when it preserves accuracy, but a reasoning model chooses how many tokens it generates, so an INT4 model that matches BF16 accuracy can still cost more per solved problem. Here we price a compressed reasoner by its genera...
- Climate & EnvironmentOpen access
Covariate Copies Count as Evidence in Time-Series Foundation Models
Covariate-aware time-series foundation models forecast a target from the related series supplied with it, and which series they receive depends on how a pipeline was built: the same sensor exported twice, a temperature in two units, one weather station joined in for several zones...
- AI & ComputingOpen access
Anytime-Valid Stopping for Self-Consistency on Open Answer Sets
Self-consistency samples reasoning chains and returns the most frequent answer, and adaptive variants stop sampling early to save compute. Deployments act on the stopped answer, yet these rules check a posterior or window criterion as draws arrive, so the chance of stopping on an...
- AI & ComputingOpen access
Edge deployments of promptable segmenters are checked by the quality of the first mask or by simulated click counts, yet an interactive tool is used through its corrections. We measure deployment on the correction itself: from the same image, click history and starting mask, we c...
- AI & ComputingOpen access
When one key is updated again and again within a single context, language models answer with a value that has already been overwritten, long before the context window fills. Suppressing attention to the stale value reduces those answers, but no study has held the deletion fixed a...
- AI & ComputingOpen access
Which Interference Does 4-Bit Weight Quantization Harm? It Depends on the Operating Point
Language models are commonly served with 4-bit weights, and the format is chosen on perplexity and benchmark averages, which do not vary how strongly the context competes with the answer. A quantized model that fails to resolve such interference can answer fluently with the compe...
- AI & ComputingOpen access
Tabular foundation models answer every query about a table by in-context inference, so whether their answers to related queries fit one joint distribution is a direct test of whether they can be used as probabilistic models of the table. A recent test of marginalization consisten...
- AI & ComputingOpen access
Anytime-Valid Stopping for Self-Consistency on Open Answer Sets
Self-consistency samples reasoning chains and returns the most frequent answer, and adaptive variants stop sampling early to save compute. Deployments act on the stopped answer, yet these rules check a posterior or window criterion as draws arrive, so the chance of stopping on an...
- AI & ComputingOpen access
When one key is updated again and again within a single context, language models answer with a value that has already been overwritten, long before the context window fills. Suppressing attention to the stale value reduces those answers, but no study has held the deletion fixed a...
- Society & EconomicsOpen access
Selecting GPTQ Damping from the Calibration Set by Nested-Ridge Leave-One-Out
GPTQ-style quantization damps the calibration Hessian by a fixed fraction of its mean diagonal (one percent in the GPTQ authors' code, five percent in a maintained implementation), a choice that ignores how many calibration rows there are. Small tabular, time-series and text-embe...
- AI & ComputingOpen access
Covariate Copies Count as Evidence in Time-Series Foundation Models
Covariate-aware time-series foundation models forecast a target from the related series supplied with it, and which series they receive depends on how a pipeline was built: the same sensor exported twice, a temperature in two units, one weather station joined in for several zones...
- Climate & EnvironmentOpen access
Covariate Copies Count as Evidence in Time-Series Foundation Models
Covariate-aware time-series foundation models forecast a target from a group of related series, and the covariates supplied to them can be redundant: the same sensor exported twice, a temperature in two units, several nearby weather stations. How these models count such redundanc...
- AI & ComputingOpen access
Tabular foundation models answer every query about a table by in-context inference, so whether their answers to related queries fit one joint distribution is a direct test of whether they can be used as probabilistic models of the table. A recent test of marginalization consisten...
- Engineering & TechnologyOpen access
Controlled evidence on 4-bit weight quantization and in-context interference is proactive-only, limited to one 4-bit format and behavioural. In 1.5–8B open-weight models we cross proactive and retroactive layouts, with a recency-counterbalanced control, with interference dose, li...
- AI & ComputingOpen access
What pass@k Measures When Attempts Share State: Count Runs, Not Attempts
Search trees, planners and self-correcting agents make the attempts of one run share a random state, yet their results are often scored with a pass@k estimator built for independent draws, which public harnesses apply to whatever attempts they receive. Prior work separates the pr...
- AI & ComputingOpen access
What pass@k Measures When Attempts Share State: Count Runs, Not Attempts
Search trees, planners and self-correcting agents make the attempts of one run share a random state, yet their results are often scored with a pass@k estimator built for independent draws, which public harnesses apply to whatever attempts they receive. Prior work separates the pr...
- Society & EconomicsOpen access
Practitioners choose between released 4-bit conversions of a model from published comparison sentences such as "AWQ consistently outperforms ... GPTQ ... (7B-70B)", although the files they serve, the serving stack and the way quality is measured all differ from what the sentence...