Source author record

Young Hyun Cho

Young Hyun Cho appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

2works
5topics
2close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

2 published item(s)

preprint2026arXiv

When Should an AI Workflow Release? Always-Valid Inference for Black-Box Generate-Verify Systems

LLM-enabled AI workflows increasingly produce outputs through iterative generate-evaluate-revise loops. Each iteration can improve the candidate, but it also creates a release decision: when to stop and output the current result? This raises a statistical challenge because deployment-time evaluator scores are adaptively generated and repeatedly monitored, yet the likelihood models or exchangeability assumptions typically used for calibration are unavailable. We propose an always-valid release wrapper for existing generator-evaluator pipelines. The wrapper builds a hard-negative reference pool of high-scoring failures, calibrates deployment-time evaluator scores against this pool, and accumulates the resulting evidence with an e-process. This separates two roles: the reference pool turns black-box scores into conservative evidence, while the e-process provides validity under optional stopping. In theory, we show that a conservative reference pool yields finite-sample control of the probability of releasing on infeasible tasks, that is, tasks for which the given workflow is not capable of producing a reliable solution. We also characterize conditions under which the same conservative rule still achieves nontrivial release on feasible tasks. In an MBPP+ coding-agent case study, the wrapper reduces premature incorrect release relative to baseline stopping rules while still releasing on tasks for which the workflow repeatedly accumulates moderate supporting evidence.

preprint2012arXiv

Inverse Systems of Zero-dimensional Schemes in P^n

The authors construct the global Macaulay inverse system for a zero-dimensional subscheme Z of projective n-space P^n, from the local inverse systems of the irreducible components of Z. They show that when Z is locally Gorenstein a generic homogeneous form F of degree d apolar to Z determines Z when d is larger than an invariant b(Z). They also show that a natural upper bound for the Hiilbert function of Gorenstein Artin quotient of the coordinate ring is achieved for large socle degree. They show the uniqueness of generalized additive decompositions of a homogeneous form F into powers of linear forms, under suitable hypotheses. They include many examples.