arXiv Machine Learning By Yan Wang

TraceForge: Distilling with Your Own Thinking

Read the original on arXiv Machine Learning →

TraceForge introduces a two‑stage training method that generates reasoning traces in the style of a target model family, using supervised learning followed by adversarial refinement. The system produces traces that are judged as authentic with scores comparable to real traces, and when applied to teacher answers, it improves performance on coding benchmarks such as HumanEval+ and MBPP+. The approach addresses the limitation of existing models that only return answers without detailed reasoning, enabling more transparent and learnable outputs.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
6d ago

EKLAV: Elicited Key CoT Learning via Answer only superVision

EKLAV is a method that uses a teacher’s chain‑of‑thought (CoT) reasoning as privileged input while supervising only the final answer. By strategically placing parts of the trace in the prompt, EKLAV improves ranking performance on BRIGHT passage reranking and table‑reranking benchmarks, outperforming full‑trace distillation and answer‑only training. The approach reduces training compute and inference time, and the generated traces show more efficient reasoning patterns.

By Adarsh Singh, Aman Singh, Kushal Raj Bhandari, Soham Dan, Anoop Kumar, Vivek Gupta
arXiv AI
Jul 17

Answer-Conditioned Chains of Thought Degrade Verifiable-Reasoning Distillation in Large Language Models

arXiv:2607. 14552v1 Announce Type: cross Abstract: A standard recipe for distilling the reasoning ability of large language models (LLMs) is to sample chains of thought from the model, keep those that reach the correct final answer, and fine-tune on the survivors.

By Jungseob Lee, Seungyoon Lee, Suhyune Son, Dongyub Jude Lee, Sungbin Han, Sugyeong Eo, Heuiseok Lim
arXiv AI
Oct 15

Splicing Hints into Reasoning Traces: Learning from Demonstrator Failures

arXiv:2610.13996v1 Announce Type: cross Abstract: Reinforcement learning with verifiable rewards improves mathematical reasoning when a final answer can be checked, but a correct answer does not cert...

By Hamed Mahdavi (Pennsylvania State University), Pouria Mahdavinia (Pennsylvania State University), Majid Farhadi (Google), Vasant Honavar (Pennsylvania State University)