Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Kumar, Raunak"'
Autor:
Fikioris, Giannis, Kleinberg, Robert, Kolumbus, Yoav, Kumar, Raunak, Mansour, Yishay, Tardos, Éva
In many repeated auction settings, participants care not only about how frequently they win but also how their winnings are distributed over time. This problem arises in various practical domains where avoiding congested demand is crucial, such as on
Externí odkaz:
http://arxiv.org/abs/2411.04843
Online convex optimization (OCO) is a widely used framework in online learning. In each round, the learner chooses a decision in a convex set and an adversary chooses a convex loss function, and then the learner suffers the loss associated with their
Externí odkaz:
http://arxiv.org/abs/2210.09903
Autor:
Kumar, Raunak, Kleinberg, Robert
Bandits with knapsacks (BwK) is an influential model of sequential decision-making under uncertainty that incorporates resource consumption constraints. In each round, the decision-maker observes an outcome consisting of a reward and a vector of nonn
Externí odkaz:
http://arxiv.org/abs/2209.12013
Autor:
Kumar, Raunak1,2,3 (AUTHOR), Sanjeev, Airy1,2,3 (AUTHOR), Devi, Naorem Leimarembi1,2,3 (AUTHOR), Shinde, Isha1,2,4 (AUTHOR), Khan, Asif1,2 (AUTHOR), Saldanha, Elveera1,2,4 (AUTHOR), Poojary, Disha1,2 (AUTHOR), Ishaqwala, Fiza1,2 (AUTHOR), Banavali, S. D.5 (AUTHOR), Dutt, Amit6 (AUTHOR), Noronha, Vanita5 (AUTHOR), Prabhash, Kumar4,5,6 (AUTHOR), Choughule, Anuradha2 (AUTHOR), Chandrani, Pratik1,2,4,6 (AUTHOR)
Publikováno v:
Indian Journal of Medical & Paediatric Oncology. 2024 Supplement 1, Vol. 45, pS1-S16. 16p.
Publikováno v:
In Journal of the Taiwan Institute of Chemical Engineers June 2024 159
Expectation maximization (EM) is the default algorithm for fitting probabilistic models with missing or latent variables, yet we lack a full understanding of its non-asymptotic convergence properties. Previous works show results along the lines of "E
Externí odkaz:
http://arxiv.org/abs/2011.01170
Pattern counting in graphs is a fundamental primitive for many network analysis tasks, and a number of methods have been developed for scaling subgraph counting to large graphs. Many real-world networks carry a natural notion of strength of connectio
Externí odkaz:
http://arxiv.org/abs/1910.00692
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Prabhash, Kumar, Saldanha, Elveera, Patil, Vijay, Bal, Munita, Reddy P, Sreekanth, Sanjeev, Airy, Kumar, Raunak, Poojary, Disha, Noronha, Vanita, Menon, Nandini, Mittal, Neha, Trivedi, Vaishakhi, Nambiar, Kavya, Mishra, Rohit, Tanwar, Nishtha, Malhotra, Richa, Pange, Priyanka, Gupta, Vinod, Veldore, Vidya H., Chougule, Anuradha
Publikováno v:
JCO Precision Oncology; 12/1/2024, Vol. 8, p1-8, 8p
Autor:
Devi, Naorem Leimarembi, Saldanha, Elveera, Kumar, Raunak, Peddagangannagari, Sreekanth Reddy, Pange, Priyanka, Gupta, Vinod, Kale, Shrutikaa, Nambiar, Kavya, Nikam, Ankita, Halu, Deepika, Durve, Arpana, Poojary, Disha, Shinde, Isha, Trivedi, Vaishakhi, Malhotra, Richa, Tanwar, Nishtha, Satheesh, Aiswarya Padmaja, Khuntia, Satya Prakash, Varghese, Linu, Kolla, Srivalli
Publikováno v:
Indian Journal of Medical & Paediatric Oncology; 2024 Supplement 1, Vol. 45, pS1-S16, 16p