Zobrazeno 1 - 10
of 1 034
pro vyhledávání: '"Haviv P"'
Generative modeling typically concerns the transport of a single source distribution to a single target distribution by learning (i.e., regressing onto) simple probability flows. However, in modern data-driven fields such as computer graphics and sin
Externí odkaz:
http://arxiv.org/abs/2411.00698
The practical use of text-to-image generation has evolved from simple, monolithic models to complex workflows that combine multiple specialized components. While workflow-based approaches can lead to improved image quality, crafting effective workflo
Externí odkaz:
http://arxiv.org/abs/2410.01731
Autor:
Chawin, Dror, Haviv, Ishay
The index coding problem is concerned with broadcasting encoded information to a collection of receivers in a way that enables each receiver to discover its required data based on its side information, which comprises the data required by some of the
Externí odkaz:
http://arxiv.org/abs/2408.08382
Autor:
Haviv, Ishay, Rabinovich, Dror
The orthogonality dimension of a graph over $\mathbb{R}$ is the smallest integer $d$ for which one can assign to every vertex a nonzero vector in $\mathbb{R}^d$ such that every two adjacent vertices receive orthogonal vectors. For an integer $d$, the
Externí odkaz:
http://arxiv.org/abs/2408.08380
This work addresses the challenge of quantifying originality in text-to-image (T2I) generative diffusion models, with a focus on copyright originality. We begin by evaluating T2I models' ability to innovate and generalize through controlled experimen
Externí odkaz:
http://arxiv.org/abs/2408.08184
Autor:
Haviv, Ishay, Parnas, Michal
A set family ${\cal F}$ is called intersecting if every two members of ${\cal F}$ intersect, and it is called uniform if all members of ${\cal F}$ share a common size. A uniform family ${\cal F} \subseteq \binom{[n]}{k}$ of $k$-subsets of $[n]$ is $\
Externí odkaz:
http://arxiv.org/abs/2404.11504
Autor:
Haviv, Doron, Kunes, Russell Zhang, Dougherty, Thomas, Burdziak, Cassandra, Nawy, Tal, Gilbert, Anna, Pe'er, Dana
Optimal transport (OT) and the related Wasserstein metric (W) are powerful and ubiquitous tools for comparing distributions. However, computing pairwise Wasserstein distances rapidly becomes intractable as cohort size grows. An attractive alternative
Externí odkaz:
http://arxiv.org/abs/2404.09411
For a field $\mathbb{F}$ and integers $d$ and $k$, a set ${\cal A} \subseteq \mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ vectors of ${\cal A}$ include an orthogonal pair. We prove that for ever
Externí odkaz:
http://arxiv.org/abs/2404.01057
Autor:
Hacohen, Uri, Haviv, Adi, Sarfaty, Shahar, Friedman, Bruria, Elkin-Koren, Niva, Livni, Roi, Bermano, Amit H
The advent of Generative Artificial Intelligence (GenAI) models, including GitHub Copilot, OpenAI GPT, and Stable Diffusion, has revolutionized content creation, enabling non-professionals to produce high-quality content across various domains. This
Externí odkaz:
http://arxiv.org/abs/2403.17691
Autor:
Chawin, Dror, Haviv, Ishay
For a field $\mathbb{F}$ and integers $d$ and $k$, a set of vectors of $\mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ of them include an orthogonal pair. We prove that for every prime $p$ there e
Externí odkaz:
http://arxiv.org/abs/2402.08274