1 citations · 1 across the 17 of their papers we have counts for
5 papers · 1 filter
Rankwidth of Graphs with Balanced Separations: Expansion for Dense Graphs
Emile Anand
We prove that every graph of rankwidth at least contains an induced subgraph whose minimum balanced cutrank is at least , which implies a vertex subset where every balance…
Global PIQA: Evaluating Commonsense Reasoning Across 100+ Languages and Cultures
Tyler A. Chang, Catherine Arnett, Abdelrahman Sadallah +377
To date, there exist almost no culturally-specific evaluation benchmarks for large language models (LLMs) that cover a large number of languages and cultures. In this paper, we pre…
Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown
Emile Anand, Sarah Liaw
Thompson Sampling (TS) is widely used to address the exploration/exploitation tradeoff in contextual bandits, yet recent theory shows that it does not explore aggressively enough i…
The Structural Complexity of Matrix-Vector Multiplication
Emile Anand, Jan van den Brand, Rose McCarty
We consider the problem of preprocessing an matrix , and supporting queries that, for any vector , returns the matrix-vector product . This…
Towards the Pseudorandomness of Expander Random Walks for Read-Once ACC0 circuits
Emile Anand
Expander graphs are among the most useful combinatorial objects in theoretical computer science. A line of work studies random walks on expander graphs for their pseudorandomness a…