2 citations · 2 across the 6 of their papers we have counts for
10 papers
OSFP4: Joint Optimization of Diagonal Smoothing and Block Scales for NVFP4 Quantization
Neriah Ben David, Ori Meir, Or Ordentlich
NVFP4 is an attractive datatype for large language model (LLM) inference, offering compact storage and native tensor-core acceleration. However, preserving accuracy using NVFP4 req…
Lifting with Inner Functions of Polynomial Discrepancy
Yahel Manor, Or Meir
Lifting theorems are theorems that bound the communication complexity of a composed function in terms of the query complexity of and the communication complexity…
Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition
Or Meir
One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits (i.e., ). Karchmer, R…
Shrinkage under Random Projections, and Cubic Formula Lower Bounds for
Yuval Filmus, Or Meir, Avishay Tal
Håstad showed that any De Morgan formula (composed of AND, OR and NOT gates) shrinks by a factor of under a random restriction…
KRW Composition Theorems via Lifting
Susanna F. de Rezende, Or Meir, Jakob Nordström +2
One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits (i.e., ). Karchmer, Raz…
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
Susanna F. de Rezende, Or Meir, Jakob Nordström +1
We establish an exactly tight relation between reversible pebblings of graphs and Nullstellensatz refutations of pebbling formulas, showing that a graph can be reversibly pebbl…