Papers by Apivich Hemachandra
Uncovering Scaling Laws for Large Language Models via Inverse Problems (2025.findings-emnlp)
Copied to clipboard
Arun Verma, Zhaoxuan Wu, Zijian Zhou, Xiaoqiang Lin, Zhiliang Chen, Rachael Hwee Ling Sim, Rui Qiao, Jingtan Wang, Nhung Bui, Xinyuan Niu, Wenyang Hu, Gregory Kang Ruey Lau, Zi-Yu Khoo, Zitong Zhao, Xinyi Xu, Apivich Hemachandra, See-Kiong Ng, Bryan Kian Hsiang Low
| Challenge: | Large Language Models (LLMs) have achieved remarkable success across diverse domains. |
| Approach: | inverse problems can efficiently uncover scaling laws that guide the building of LLMs, authors argue . authors propose brute-force approaches to improve LLM training costs due to high costs . |
| Outcome: | This paper advocates that inverse problems can efficiently uncover scaling laws that guide the building of LLMs to achieve the desirable performance with significantly better cost-effectiveness. |