Zobrazeno 1 - 10
of 547
pro vyhledávání: '"Tetali, P"'
Large language models (LLMs) have been used to generate formal proofs of mathematical theorems in proofs assistants such as Lean. However, we often want to optimize a formal proof with respect to various criteria, depending on its downstream use. For
Externí odkaz:
http://arxiv.org/abs/2410.04753
Autor:
Wilson, Ethan, Ibragimov, Azim, Proulx, Michael J., Tetali, Sai Deep, Butler, Kevin, Jain, Eakta
Eye tracking is routinely being incorporated into virtual reality (VR) systems. Prior research has shown that eye tracking data, if exposed, can be used for re-identification attacks. The state of our knowledge about currently existing privacy mechan
Externí odkaz:
http://arxiv.org/abs/2402.07687
With the recent success of representation learning methods, which includes deep learning as a special case, there has been considerable interest in developing techniques that incorporate known physical constraints into the learned representation. As
Externí odkaz:
http://arxiv.org/abs/2312.13584
We give a short and self-contained argument that shows that, for any positive integers $t$ and $n$ with $t =O\Bigl(\frac{n}{\log n}\Bigr)$, the number $\alpha([t]^n)$ of antichains of the poset $[t]^n$ is at most \[\exp_2\Bigl(1+O\Bigl(\Bigl(\frac{t\
Externí odkaz:
http://arxiv.org/abs/2305.16520
We analyze the generalization ability of joint-training meta learning algorithms via the Gibbs algorithm. Our exact characterization of the expected meta generalization error for the meta Gibbs algorithm is based on symmetrized KL information, which
Externí odkaz:
http://arxiv.org/abs/2304.14332
We study the locations of complex zeroes of independence polynomials of bounded degree hypergraphs. For graphs, this is a long-studied subject with applications to statistical physics, algorithms, and combinatorics. Results on zero-free regions for b
Externí odkaz:
http://arxiv.org/abs/2211.00464
Publikováno v:
Journal of Horticultural Research, Vol 32, Iss 1, Pp 33-42 (2024)
In quantitative reverse transcription polymerase chain reaction (qRT-PCR), normalizing target gene expression using a reference gene is an indispensable step to control the variability of RNA extraction yield, RNA integrity, reverse transcription eff
Externí odkaz:
https://doaj.org/article/afc77d64e53846fc9a50075635d045bc
The cost due to delay in services may be intrinsically different for various applications of vehicle routing such as medical emergencies, logistical operations, and ride-sharing. We study a fundamental generalization of the Traveling Salesman Problem
Externí odkaz:
http://arxiv.org/abs/2208.04410
Determinant maximization problem gives a general framework that models problems arising in as diverse fields as statistics \cite{pukelsheim2006optimal}, convex geometry \cite{Khachiyan1996}, fair allocations\linebreak \cite{anari2016nash}, combinator
Externí odkaz:
http://arxiv.org/abs/2207.04318
The minimum linear ordering problem (MLOP) generalizes well-known combinatorial optimization problems such as minimum linear arrangement and minimum sum set cover. MLOP seeks to minimize an aggregated cost $f(\cdot)$ due to an ordering $\sigma$ of th
Externí odkaz:
http://arxiv.org/abs/2108.00914