activity
20202026
most citedMulticlass Learnability Beyond the PAC Framework: Universal Rates and Partial Concept Classes

2 citations · 6 across the 31 of their papers we have counts for

collaborators
Showing 2024Show all

10 papers · 1 filter

cs.LG2024

On Characterizations for Language Generation: Interplay of Hallucinations, Breadth, and Stability

Alkis Kalavasis, Anay Mehrotra, Grigoris Velegkas

We study language generation in the limit - introduced by Kleinberg and Mullainathan [KM24] - building on classical works of Gold [Gol67] and Angluin [Ang79]. [KM24]'s main result…

cs.GT2024

Computational Lower Bounds for Regret Minimization in Normal-Form Games

Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm

A celebrated connection in the interface of online learning and game theory establishes that players minimizing swap regret converge to correlated equilibria (CE) -- a seminal game…

cs.GT2024

Barriers to Welfare Maximization with No-Regret Learning

Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm

A celebrated result in the interface of online learning and game theory guarantees that the repeated interaction of no-regret players leads to a coarse correlated equilibrium (CCE)…

cs.LG2024★ 1 cited

On the Limits of Language Generation: Trade-Offs Between Hallucination and Mode Collapse

Alkis Kalavasis, Anay Mehrotra, Grigoris Velegkas

Specifying all desirable properties of a language model is challenging, but certain requirements seem essential. Given samples from an unknown language, the trained model should pr…

stat.ME2024

Smaller Confidence Intervals From IPW Estimators via Data-Dependent Coarsening

Alkis Kalavasis, Anay Mehrotra, Manolis Zampetakis

Inverse propensity-score weighted (IPW) estimators are prevalent in causal inference for estimating average treatment effects in observational studies. Under unconfoundedness, give…

cs.DS2024

On Sampling from Ising Models with Spectral Constraints

Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros

We consider the problem of sampling from the Ising model when the underlying interaction matrix has eigenvalues lying within an interval of length . Recent work in this setting…

cs.LG2024

Injecting Undetectable Backdoors in Obfuscated Neural Networks and Language Models

Alkis Kalavasis, Amin Karbasi, Argyris Oikonomou +3

As ML models become increasingly complex and integral to high-stakes domains such as finance and healthcare, they also become more susceptible to sophisticated adversarial attacks.…

cs.LG2024

On the Computational Landscape of Replicable Learning

Alkis Kalavasis, Amin Karbasi, Grigoris Velegkas +1

We study computational aspects of algorithmic replicability, a notion of stability introduced by Impagliazzo, Lei, Pitassi, and Sorrell [2022]. Motivated by a recent line of work t…

cs.LG2024

Transfer Learning Beyond Bounded Density Ratios

Alkis Kalavasis, Ilias Zadik, Manolis Zampetakis

We study the fundamental problem of transfer learning where a learning algorithm collects data from some source distribution but needs to perform well with respect to a differe…

cs.LG2024

Replicable Learning of Large-Margin Halfspaces

Alkis Kalavasis, Amin Karbasi, Kasper Green Larsen +2

We provide efficient replicable algorithms for the problem of learning large-margin halfspaces. Our results improve upon the algorithms provided by Impagliazzo, Lei, Pitassi, and S…