The reviewed record of science sign in
Pith

arxiv: 2409.17308 · v2 · pith:AZA3F3OL · submitted 2024-09-25 · cs.LG · math.ST· stat.TH

Consistent estimation of generative model representations in the data kernel perspective space

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:AZA3F3OLrecord.jsonopen to challenge →

classification cs.LG math.STstat.TH
keywords modelsgenerativemodelqueryconsistentdifferentestimationinformation
0
0 comments X
read the original abstract

Generative models, such as large language models and text-to-image diffusion models, produce relevant information when presented a query. Different models may produce different information when presented the same query. As the landscape of generative models evolves, it is important to develop techniques to study and analyze differences in model behaviour. In this paper we present novel theoretical results for embedding-based representations of generative models in the context of a set of queries. In particular, we establish sufficient conditions for the consistent estimation of the model embeddings in situations where the query set and the number of models grow.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Recovering manifold structure in LLM responses through a joint Euclidean mirror

    stat.ME 2026-04 unverdicted novelty 7.0

    A joint Euclidean mirror embeds LLM response distributions to recover manifold structure with respect to tuning parameters, enabling consistent inference of those parameters from samples.

  2. Black-box model classification under the discriminative factorization

    cs.LG 2026-05 unverdicted novelty 6.0

    Discriminative factorization distinguishes high-quality query sets for black-box model classification, with chance-level error decaying exponentially in query budget and parameters predicting empirical decay rates on ...

  3. Query-efficient model evaluation using cached responses

    cs.LG 2026-05 unverdicted novelty 6.0

    DKPS-based methods leverage cached model responses to achieve equivalent benchmark prediction accuracy with substantially fewer queries than standard evaluation.

  4. Query-efficient model evaluation using cached responses

    cs.LG 2026-05 unverdicted novelty 6.0

    DKPS-based methods predict new model benchmark scores using cached responses, matching baseline mean absolute error with substantially fewer queries and an offline query selection approach.

  5. Jailbreak susceptibility prediction and mitigation via the behavioral geometry of models

    cs.CR 2026-05 unverdicted novelty 5.0

    Behavioral geometry of model populations enables high-accuracy jailbreak susceptibility prediction and defense transfer with 98% fewer evaluations.

  6. Control Charts for Multi-agent Systems

    cs.MA 2026-05 unverdicted novelty 5.0

    Adaptive control charts can monitor learning multi-agent systems but are vulnerable to gradual adversarial defection, revealing a fundamental tradeoff between allowing agents to learn and maintaining security against ...