Zobrazeno 1 - 10
of 2 741
pro vyhledávání: '"GUPTA, NEHA"'
In this paper, we give closed form expressions of the Frobenius number for the triple of the $2$-step star numbers $an(n-2) + 1$ for an integer $a \geq 4$. These numbers have been studied from different aspects for some $a$'s. These numbers can also
Externí odkaz:
http://arxiv.org/abs/2409.14788
Autor:
Gupta, Neha, Maheshwari, Aditya
In this paper, we propose an extension of the Hawkes process by incorporating a kernel based on the tempered Mittag-Leffler distribution. This is the generalization of the work presented in [10]. We derive analytical results for the expectation of th
Externí odkaz:
http://arxiv.org/abs/2408.11695
Research in Responsible AI has developed a range of principles and practices to ensure that machine learning systems are used in a manner that is ethical and aligned with human values. However, a critical yet often neglected aspect of ethical ML is t
Externí odkaz:
http://arxiv.org/abs/2408.10239
Autor:
Narasimhan, Harikrishna, Jitkrittum, Wittawat, Rawat, Ankit Singh, Kim, Seungyeon, Gupta, Neha, Menon, Aditya Krishna, Kumar, Sanjiv
Cascades and speculative decoding are two common approaches to improving language models' inference efficiency. Both approaches involve interleaving models of different sizes, but via fundamentally distinct mechanisms: cascades employ a deferral rule
Externí odkaz:
http://arxiv.org/abs/2405.19261
Autor:
Gupta, Neha, Maheshwari, Aditya
Hawkes process (HP) is a point process with a conditionally dependent intensity function. This paper defines the tempered fractional Hawkes process (TFHP) by time-changing the HP with an inverse tempered stable subordinator. We obtained results that
Externí odkaz:
http://arxiv.org/abs/2405.09966
Autor:
Gupta, Neha, Narasimhan, Harikrishna, Jitkrittum, Wittawat, Rawat, Ankit Singh, Menon, Aditya Krishna, Kumar, Sanjiv
Recent advances in language models (LMs) have led to significant improvements in quality on complex NLP tasks, but at the expense of increased inference costs. Cascading offers a simple strategy to achieve more favorable cost-quality tradeoffs: here,
Externí odkaz:
http://arxiv.org/abs/2404.10136
Autor:
Gupta, Neha, N, Suhith K
A neural code on $ n $ neurons is a collection of subsets of the set $ [n]=\{1,2,\dots,n\} $. Curto et al. \cite{curto2013neural} associated a ring $\mathcal{R}_{\mathcal{C}}$ (neural ring) to a neural code $\mathcal{C}$. A special class of ring homo
Externí odkaz:
http://arxiv.org/abs/2403.17558
Autor:
N, Suhith K, Gupta, Neha
A neural code on $ n $ neurons is a collection of subsets of the set $ [n]=\{1,2,\dots,n\} $. In this paper, we study some properties of graphs of neural codes. In particular, we study codeword containment graph (CCG) given by Chan et al. (SIAM J. on
Externí odkaz:
http://arxiv.org/abs/2403.17548
We give an explicit formula for the $p$-Frobenius number of triples associated with Diophantine equations $x^2+y^2=z^r$, that is, the largest positive integer that can only be represented in $p$ ways by combining the three integers of the solutions o
Externí odkaz:
http://arxiv.org/abs/2403.07534