Suivre
Rushang Karia
Rushang Karia
Adresse e-mail validée de asu.edu
Titre
Citée par
Citée par
Année
Super-naturalinstructions: Generalization via declarative instructions on 1600+ nlp tasks
Y Wang, S Mishra, P Alipoormolabashi, Y Kordi, A Mirzaei, A Arunkumar, ...
arXiv preprint arXiv:2204.07705, 2022
4912022
Sujan Reddy A, Sumanta Patro, Tanay Dixit, and Xudong Shen. 2022. Super-NaturalInstructions: Generalization via declarative instructions on 1600+ NLP tasks
Y Wang, S Mishra, P Alipoormolabashi, Y Kordi, A Mirzaei, A Naik, ...
Proceedings of the 2022 Conference on Empirical Methods in Natural Language …, 2022
1902022
Benchmarking generalization via in-context instructions on 1,600+ language tasks
Y Wang, S Mishra, P Alipoormolabashi, Y Kordi, A Mirzaei, A Arunkumar, ...
arXiv preprint arXiv:2204.07705 2, 2022
1292022
Learning generalized relational heuristic networks for model-agnostic planning
R Karia, S Srivastava
Proceedings of the AAAI Conference on Artificial Intelligence 35 (9), 8064-8073, 2021
532021
Relational Abstractions for Generalized Reinforcement Learning on Symbolic Problems
R Karia, S Srivastava
arXiv preprint arXiv:2204.12665, 2022
202022
Autonomous capability assessment of sequential decision-making systems in stochastic settings
P Verma, R Karia, S Srivastava
Advances in Neural Information Processing Systems 36, 2024
92024
Learning Generalized Policy Automata for Relational Stochastic Shortest Path Problems
R Karia, RK Nayyar, S Srivastava
Advances in Neural Information Processing Systems 35, 30625-30637, 2022
62022
Preliminary Results on Using Abstract AND-OR Graphs for Generalized Solving of Stochastic Shortest Path Problems.
R Karia, RK Nayyar, S Srivastava
CoRR, 2022
6*2022
S., Patro, S., Dixit, T., and Shen, X. Super-NaturalInstructions: Generalization via declarative instructions on 1600+ NLP tasks
Y Wang, S Mishra, P Alipoormolabashi, Y Kordi, A Mirzaei, A Naik, ...
Proceedings of the 2022 Conference on Empirical Methods in Natural Language …, 0
5
Epistemic Exploration for Generalizable Planning and Learning in Non-Stationary Settings
R Karia, P Verma, A Speranzon, S Srivastava
arXiv preprint arXiv:2402.08145, 2024
22024
Learning AI-System Capabilities under Stochasticity
P Verma, R Karia, G Vipat, A Gupta, S Srivastava
NeurIPS 2023 Workshop on Generalization in Planning, 2023
22023
Autonomous Capability Assessment of Black-Box Sequential Decision-Making Systems
P Verma, R Karia, S Srivastava
arXiv preprint arXiv:2306.04806, 2023
22023
Supervised learning with closed loop feedback to improve ioconsistency of solid state drives
R Karia, M Wongso, J Schmier, K Corbin, LR Chintada
US Patent 10,877,667, 2020
22020
Using Explainable AI and Hierarchical Planning for Outreach with Robots
D Dobhal, J Nagpal, R Karia, P Verma, RK Nayyar, N Shah, S Srivastava
arXiv preprint arXiv:2404.00808, 2024
12024
Can LLMs Converse Formally? Automatically Assessing LLMs in Translating and Interpreting Formal Specifications
R Karia, D Dobhal, D Bramblett, P Verma, S Srivastava
arXiv preprint arXiv:2403.18327, 2024
12024
Epistemic Exploration for Generalizable Planning and Learning in Non-Stationary Stochastic Settings
R Karia, P Verma, G Vipat, S Srivastava
NeurIPS 2023 Workshop on Generalization in Planning, 2023
12023
Supervised learning with closed loop feedback to improve input output consistency of solid state drives
R Karia, M Wongso, J Schmier, K Corbin, LR Chintada
US Patent 11,640,243, 2023
2023
Sujan Reddy A, Sumanta Patro, Tanay Dixit, and Xudong Shen. Super-NaturalInstructions: Generalization via declarative instructions on 1600+ NLP tasks
Y Wang, S Mishra, P Alipoormolabashi, Y Kordi, A Mirzaei, A Naik, ...
Proceedings of the 2022 Conference on Empirical Methods in Natural Language …, 2022
2022
Method and system for input-output throttling to improve quality of service in a solid state drive
M Wongso, R Karia, E Daelli, J Schmier, K Corbin, LR Chintada
US Patent 10,956,083, 2021
2021
Covering Arrays: Generation and Post-optimization
RV Karia
Arizona State University, 2015
2015
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20