arXiv — Machine Learning · · 3 min read

Recovering Nonlinear Functions of Latent Variables: A Plausible-Value Neural Network Framework

Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.

Statistics > Methodology

arXiv:2608.19282 (stat)
[Submitted on 19 Aug 2026]

Title:Recovering Nonlinear Functions of Latent Variables: A Plausible-Value Neural Network Framework

Authors:Eunjeong Song (1), Sehee Hong (1) ((1) Department of Education, Korea University, Seoul, Republic of Korea)
View a PDF of the paper titled Recovering Nonlinear Functions of Latent Variables: A Plausible-Value Neural Network Framework, by Eunjeong Song (1) and 4 other authors
View PDF
Abstract:When factor scores replace true latent scores in nonlinear prediction, measurement error attenuates the recoverable variance of any $k$th-order component of the regression function by $\rho^k$ -- the $k$th power of the score's coefficient of determination -- for any linear score type. This study derives the bound via Hermite polynomial expansion and proposes PV-ANN -- plausible values (posterior draws preserving latent variance) combined with artificial neural networks (learning functional form without prespecification). The bound governs recovery of the latent-scale function, not prediction of the outcome from observed indicators, for which factor scores are already sufficient; the two metrics are therefore predicted to dissociate. An 18-condition simulation supports both predictions: in the nonlinear low-reliability conditions PV-ANN closes about four fifths of the function-shape recovery gap between a factor-score learner and one given the true latent values, and the margin widens as reliability falls, while predictive accuracy is not improved, as the theory requires. A Big Five application illustrates the intended exploratory workflow and delineates boundary conditions under weak signal and measurement model misspecification.
Comments: 51 pages, 4 figures, 24 tables. Data, materials, and code: this https URL
Subjects: Methodology (stat.ME); Machine Learning (cs.LG)
Cite as: arXiv:2608.19282 [stat.ME]
  (or arXiv:2608.19282v1 [stat.ME] for this version)
  https://doi.org/10.48550/arXiv.2608.19282
arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Eunjeong Song [view email]
[v1] Wed, 19 Aug 2026 08:27:55 UTC (3,807 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Recovering Nonlinear Functions of Latent Variables: A Plausible-Value Neural Network Framework, by Eunjeong Song (1) and 4 other authors
  • View PDF

Current browse context:

stat.ME
< prev   |   next >
Change to browse by:

References & Citations

Loading...

BibTeX formatted citation

loading...
Data provided by:

Bookmark

BibSonomy Reddit
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from arXiv — Machine Learning