Zobrazeno 1 - 10
of 24 311
pro vyhledávání: '"Kanade, A."'
Autor:
Kanade, Shashank, Lovejoy, Jeremy
We show how Bailey pairs can be used to give a simple proof of an identity of Chern, Li, Stanton, Xue, and Yee. The same method yields a number of related identities as well as false theta companions.
Externí odkaz:
http://arxiv.org/abs/2410.15408
Autor:
Singh, Usneek, Cambronero, José, Gulwani, Sumit, Kanade, Aditya, Khatry, Anirudh, Le, Vu, Singh, Mukul, Verbruggen, Gust
Large language models (LLMs) can be leveraged to help with writing formulas in spreadsheets, but resources on these formulas are scarce, impacting both the base performance of pre-trained models and limiting the ability to fine-tune them. Given a cor
Externí odkaz:
http://arxiv.org/abs/2407.10657
Autor:
Arora, Daman, Sonwane, Atharv, Wadhwa, Nalin, Mehrotra, Abhav, Utpala, Saiteja, Bairi, Ramakrishna, Kanade, Aditya, Natarajan, Nagarajan
A common method to solve complex problems in software engineering, is to divide the problem into multiple sub-problems. Inspired by this, we propose a Modular Architecture for Software-engineering AI (MASAI) agents, where different LLM-powered sub-ag
Externí odkaz:
http://arxiv.org/abs/2406.11638
Transformer architectures have been widely adopted in foundation models. Due to their high inference costs, there is renewed interest in exploring the potential of efficient recurrent architectures (RNNs). In this paper, we analyze the differences in
Externí odkaz:
http://arxiv.org/abs/2406.09347
Autor:
Deshpande, Ajinkya, Agarwal, Anmol, Shet, Shashank, Iyer, Arun, Kanade, Aditya, Bairi, Ramakrishna, Parthasarathy, Suresh
LLMs have demonstrated significant potential in code generation tasks, achieving promising results at the function or statement level across various benchmarks. However, the complexities associated with creating code artifacts like classes, particula
Externí odkaz:
http://arxiv.org/abs/2405.01573
In a sequence of two papers, S. Capparelli, A. Meurman, A. Primc, M. Primc (CMPP) and then M. Primc put forth three remarkable sets of conjectures, stating that the generating functions of coloured integer partition in which the parts satisfy restric
Externí odkaz:
http://arxiv.org/abs/2404.03851
Existing evaluation benchmarks of language models of code (code LMs) focus almost exclusively on whether the LMs can generate functionally-correct code. In real-world software engineering, developers think beyond functional correctness. They have req
Externí odkaz:
http://arxiv.org/abs/2401.15963
Autor:
Kanade, Shashank
We study coloured invariants of torus knots $T(p,p')$ (where $p,p'$ are coprime positive integers). When the colouring Lie algebra is simply-laced, and when $p,p'\geq h^\vee$, we use the representation theory of the corresponding principal affine $\m
Externí odkaz:
http://arxiv.org/abs/2401.15230
In order to understand the in-context learning phenomenon, recent works have adopted a stylized experimental framework and demonstrated that Transformers can learn gradient-based learning algorithms for various classes of real-valued functions. Howev
Externí odkaz:
http://arxiv.org/abs/2310.03016
Autor:
Wadhwa, Nalin, Pradhan, Jui, Sonwane, Atharv, Sahu, Surya Prakash, Natarajan, Nagarajan, Kanade, Aditya, Parthasarathy, Suresh, Rajamani, Sriram
As software projects progress, quality of code assumes paramount importance as it affects reliability, maintainability and security of software. For this reason, static analysis tools are used in developer workflows to flag code quality issues. Howev
Externí odkaz:
http://arxiv.org/abs/2309.12938