Predicting Through Generation: Why Generation Is Better for Prediction
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910969466191872 |
|---|---|
| author | Kowsher, Md Prottasha, Nusrat Jahan Bhat, Prakash Yu, Chun-Nam Soltanalian, Mojtaba Garibay, Ivan Garibay, Ozlem Chen, Chen Yousefi, Niloofar |
| author_facet | Kowsher, Md Prottasha, Nusrat Jahan Bhat, Prakash Yu, Chun-Nam Soltanalian, Mojtaba Garibay, Ivan Garibay, Ozlem Chen, Chen Yousefi, Niloofar |
| contents | This paper argues that generating output tokens is more effective than using pooled representations for prediction tasks because token-level generation retains more mutual information. Since LLMs are trained on massive text corpora using next-token prediction, generation aligns naturally with their learned behavior. Using the Data Processing Inequality (DPI), we provide both theoretical and empirical evidence supporting this claim. However, autoregressive models face two key challenges when used for prediction: (1) exposure bias, where the model sees ground truth tokens during training but relies on its own predictions during inference, leading to errors, and (2) format mismatch, where discrete tokens do not always align with the tasks required output structure. To address these challenges, we introduce PredGen(Predicting Through Generating), an end to end framework that (i) uses scheduled sampling to reduce exposure bias, and (ii) introduces a task adapter to convert the generated tokens into structured outputs. Additionally, we introduce Writer-Director Alignment Loss (WDAL), which ensures consistency between token generation and final task predictions, improving both text coherence and numerical accuracy. We evaluate PredGen on multiple classification and regression benchmarks. Our results show that PredGen consistently outperforms standard baselines, demonstrating its effectiveness in structured prediction tasks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_17817 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Predicting Through Generation: Why Generation Is Better for Prediction Kowsher, Md Prottasha, Nusrat Jahan Bhat, Prakash Yu, Chun-Nam Soltanalian, Mojtaba Garibay, Ivan Garibay, Ozlem Chen, Chen Yousefi, Niloofar Computation and Language This paper argues that generating output tokens is more effective than using pooled representations for prediction tasks because token-level generation retains more mutual information. Since LLMs are trained on massive text corpora using next-token prediction, generation aligns naturally with their learned behavior. Using the Data Processing Inequality (DPI), we provide both theoretical and empirical evidence supporting this claim. However, autoregressive models face two key challenges when used for prediction: (1) exposure bias, where the model sees ground truth tokens during training but relies on its own predictions during inference, leading to errors, and (2) format mismatch, where discrete tokens do not always align with the tasks required output structure. To address these challenges, we introduce PredGen(Predicting Through Generating), an end to end framework that (i) uses scheduled sampling to reduce exposure bias, and (ii) introduces a task adapter to convert the generated tokens into structured outputs. Additionally, we introduce Writer-Director Alignment Loss (WDAL), which ensures consistency between token generation and final task predictions, improving both text coherence and numerical accuracy. We evaluate PredGen on multiple classification and regression benchmarks. Our results show that PredGen consistently outperforms standard baselines, demonstrating its effectiveness in structured prediction tasks. |
| title | Predicting Through Generation: Why Generation Is Better for Prediction |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2502.17817 |