activity
20082021
most citedOn the Degrees-of-Freedom of the K-User Gaussian Interference Channel

15 citations · 26 across the 6 of their papers we have counts for

collaborators

7 papers

math.OC2021

Hyperfast Second-Order Local Solvers for Efficient Statistically Preconditioned Distributed Optimization

Pavel Dvurechensky, Dmitry Kamzolov, Aleksandr Lukashevich +4

Statistical preconditioning enables fast methods for distributed large-scale empirical risk minimization problems. In this approach, multiple worker nodes compute gradients in para…

cs.IT2020

Denoising as well as the best of any two denoisers

Erik Ordentlich

Given two arbitrary sequences of denoisers for block lengths tending to infinity we ask if it is possible to construct a third sequence of denoisers with an asymptotically vanishin…

cs.LG2020★ 11 cited

Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions

Yanjun Han, Zhengyuan Zhou, Aaron Flores +2

First-price auctions have very recently swept the online advertising industry, replacing second-price auctions as the predominant auction mechanism on many platforms. This shift ha…

cs.IR2016

Scalable Semantic Matching of Queries to Ads in Sponsored Search Advertising

Mihajlo Grbovic, Nemanja Djuric, Vladan Radosavljevic +6

Sponsored search represents a major source of revenue for web search engines. This popular advertising model brings a unique possibility for advertisers to target users' immediate…

cs.CL2016

Network-Efficient Distributed Word2vec Training System for Large Vocabularies

Erik Ordentlich, Lee Yang, Andy Feng +5

Word2vec is a popular family of algorithms for unsupervised training of dense vector representations of words on large text corpuses. The resulting vectors have been shown to captu…

cs.IT2009★ 15 cited

On the Degrees-of-Freedom of the K-User Gaussian Interference Channel

Raul Etkin, Erik Ordentlich

The degrees-of-freedom of a K-user Gaussian interference channel (GIFC) has been defined to be the multiple of (1/2)log_2(P) at which the maximum sum of achievable rates grows with…