@conference {2025,
	title = {End-to-End Text-to-SQL with Dataset Selection: Leveraging LLMs for Adaptive Query Generation},
	booktitle = {Proceedings of IJCNN, Rome, Italy},
	year = {2025},
	doi = {10.1109/IJCNN64981.2025.11227747},
	url = {https://arxiv.org/abs/2508.06387},
	author = {A. Tripathi and V. Patle and A. Jain and A. Pundir and S. Menon and A. Kumar Singh and D. Herremans}
}
@conference {2025,
	title = {HHNAS-AM: Hierarchical Hybrid Neural Architecture Search using Adaptive Mutation Policies},
	booktitle = {arXiv:2508.14946},
	year = {2025},
	abstract = {Neural Architecture Search (NAS) has garnered significant research interest due to its capability to discover architectures superior to manually designed ones. Learning text representation is crucial for text classification and other language-related tasks. The NAS model used in text classification does not have a Hybrid hierarchical structure, and there is no restriction on the architecture structure, due to which the search space becomes very large and mostly redundant, so the existing RL models are not able to navigate the search space effectively. Also, doing a flat architecture search leads to an unorganised search space, which is difficult to traverse. For this purpose, we propose HHNAS-AM (Hierarchical Hybrid Neural Architecture Search with Adaptive Mutation Policies), a novel approach that efficiently explores diverse architectural configurations. We introduce a few architectural templates to search on which organise the search spaces, where search spaces are designed on the basis of domain-specific cues. Our method employs mutation strategies that dynamically adapt based on performance feedback from previous iterations using Q-learning, enabling a more effective and accelerated traversal of the search space. The proposed model is fully probabilistic, enabling effective exploration of the search space. We evaluate our approach on the database id (db_id) prediction task, where it consistently discovers high-performing architectures across multiple experiments. On the Spider dataset, our method achieves an 8\% improvement in test accuracy over existing baselines.},
	url = {https://arxiv.org/abs/2508.14946},
	author = {A. Tripathi and A. Kumar Singh and R. Surya and A. Gupta and S.L. Veikho and D. Herremans and S. Bisane}
}
