Guardado en:
| Autores principales: | Kaplan, Iris, Ordentlich, Or |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2505.13164 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
High-Rate Quantized Matrix Multiplication I
por: Ordentlich, Or, et al.
Publicado: (2026)
por: Ordentlich, Or, et al.
Publicado: (2026)
High-Rate Quantized Matrix Multiplication II
por: Ordentlich, Or, et al.
Publicado: (2026)
por: Ordentlich, Or, et al.
Publicado: (2026)
NestQuant: Nested Lattice Quantization for Matrix Products and LLMs
por: Savkin, Semyon, et al.
Publicado: (2025)
por: Savkin, Semyon, et al.
Publicado: (2025)
Optimal Quantization for Matrix Multiplication
por: Ordentlich, Or, et al.
Publicado: (2024)
por: Ordentlich, Or, et al.
Publicado: (2024)
The Voronoi Spherical CDF for Lattices and Linear Codes: New Bounds for Quantization and Coding
por: Ordentlich, Or
Publicado: (2025)
por: Ordentlich, Or
Publicado: (2025)
Memory Complexity of Estimating Entropy and Mutual Information
por: Berg, Tomer, et al.
Publicado: (2024)
por: Berg, Tomer, et al.
Publicado: (2024)
Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining
por: Erez, Uri, et al.
Publicado: (2024)
por: Erez, Uri, et al.
Publicado: (2024)
The strong data processing inequality under the heat flow
por: Klartag, Bo'az, et al.
Publicado: (2024)
por: Klartag, Bo'az, et al.
Publicado: (2024)
Statistical Inference with Limited Memory: A Survey
por: Berg, Tomer, et al.
Publicado: (2023)
por: Berg, Tomer, et al.
Publicado: (2023)
Price of universality in vector quantization is at most 0.11 bit
por: Harbuzova, Alina, et al.
Publicado: (2026)
por: Harbuzova, Alina, et al.
Publicado: (2026)
Optimal Online Bookmaking for Binary Games
por: Bhatt, Alankrita, et al.
Publicado: (2025)
por: Bhatt, Alankrita, et al.
Publicado: (2025)
WaterSIC: information-theoretically (near) optimal linear layer quantization
por: Lifar, Egor, et al.
Publicado: (2026)
por: Lifar, Egor, et al.
Publicado: (2026)
Optimal Scalar Quantization for Matrix Multiplication: Closed-Form Density and Phase Transition
por: Ang, Calvin, et al.
Publicado: (2026)
por: Ang, Calvin, et al.
Publicado: (2026)
CRYSTALS-Kyber With Lattice Quantizer
por: Liu, Shuiyin, et al.
Publicado: (2024)
por: Liu, Shuiyin, et al.
Publicado: (2024)
Distributed Batch Matrix Multiplication: Trade-Offs in Download Rate, Randomness, and Privacy
por: Morteza, Amirhosein, et al.
Publicado: (2025)
por: Morteza, Amirhosein, et al.
Publicado: (2025)
Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions
por: Han, Yanjun, et al.
Publicado: (2020)
por: Han, Yanjun, et al.
Publicado: (2020)
Fast Matrix Multiplications for Lookup Table-Quantized LLMs
por: Guo, Han, et al.
Publicado: (2024)
por: Guo, Han, et al.
Publicado: (2024)
Distributed Structured Matrix Multiplication
por: Malak, Derya
Publicado: (2024)
por: Malak, Derya
Publicado: (2024)
Optimization and Identification of Lattice Quantizers
por: Agrell, Erik, et al.
Publicado: (2024)
por: Agrell, Erik, et al.
Publicado: (2024)
Scalar Lattices and Probabilistic Shaping for Dithered Wyner-Ziv Quantization
por: Sener, Muhammed Yusuf, et al.
Publicado: (2025)
por: Sener, Muhammed Yusuf, et al.
Publicado: (2025)
Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication
por: Gómez-Vilardebó, Jesús, et al.
Publicado: (2024)
por: Gómez-Vilardebó, Jesús, et al.
Publicado: (2024)
Quantization Design for Resistive Memories With Multiple Reads
por: Mei, Zhen, et al.
Publicado: (2024)
por: Mei, Zhen, et al.
Publicado: (2024)
Low-rank Matrix Sensing With Dithered One-Bit Quantization
por: Yeganegi, Farhang, et al.
Publicado: (2023)
por: Yeganegi, Farhang, et al.
Publicado: (2023)
Characterizing the Optimal Memory-Rate Tradeoff in Secure Coded Caching for Small Buffer or Small Rate
por: Fang, Han, et al.
Publicado: (2025)
por: Fang, Han, et al.
Publicado: (2025)
Analog Secure Distributed Matrix Multiplication
por: Makkonen, Okko, et al.
Publicado: (2025)
por: Makkonen, Okko, et al.
Publicado: (2025)
Secure Distributed Matrix Multiplication with Precomputation
por: Cartor, Ryann, et al.
Publicado: (2024)
por: Cartor, Ryann, et al.
Publicado: (2024)
Structured Codes for Distributed Matrix Multiplication
por: Malak, Derya
Publicado: (2024)
por: Malak, Derya
Publicado: (2024)
Lower Bound on the Error Rate of Genie-Aided Lattice Decoding
por: Xue, Jiajie, et al.
Publicado: (2025)
por: Xue, Jiajie, et al.
Publicado: (2025)
Interactive Coding with Small Memory and Improved Rate
por: Fathollahi, Dorsa, et al.
Publicado: (2024)
por: Fathollahi, Dorsa, et al.
Publicado: (2024)
Distributed Matrix Multiplication-Friendly Algebraic Function Fields
por: Zhu, Yun Long, et al.
Publicado: (2025)
por: Zhu, Yun Long, et al.
Publicado: (2025)
Parametric Lattices Are Better Quantizers in Dimensions 13 and 14
por: Pook-Kolb, Daniel, et al.
Publicado: (2024)
por: Pook-Kolb, Daniel, et al.
Publicado: (2024)
CAT and DOG: Improved Codes for Private Distributed Matrix Multiplication
por: Hofmeister, Christoph, et al.
Publicado: (2025)
por: Hofmeister, Christoph, et al.
Publicado: (2025)
Modular Polynomial Codes for Secure and Robust Distributed Matrix Multiplication
por: Karpuk, David, et al.
Publicado: (2023)
por: Karpuk, David, et al.
Publicado: (2023)
Nested Symmetric Polar Codes
por: Rübenacke, Marvin, et al.
Publicado: (2024)
por: Rübenacke, Marvin, et al.
Publicado: (2024)
QML-IB: Quantized Collaborative Intelligence between Multiple Devices and the Mobile Network
por: Peng, Jingchen, et al.
Publicado: (2024)
por: Peng, Jingchen, et al.
Publicado: (2024)
Time Encoding Quantization of Bandlimited and Finite-Rate-of-Innovation Signals
por: Naaman, Hila, et al.
Publicado: (2021)
por: Naaman, Hila, et al.
Publicado: (2021)
Lattice-Code Multiple Access: Architecture and Efficient Algorithms
por: Yu, Tao Yang. Fangtao, et al.
Publicado: (2022)
por: Yu, Tao Yang. Fangtao, et al.
Publicado: (2022)
General Framework for Linear Secure Distributed Matrix Multiplication with Byzantine Servers
por: Makkonen, Okko, et al.
Publicado: (2022)
por: Makkonen, Okko, et al.
Publicado: (2022)
From Quasi-Isometric Embeddings to Finite-Volume Property: A Theoretical Framework for Quantized Matrix Completion
por: Eamaz, Arian, et al.
Publicado: (2023)
por: Eamaz, Arian, et al.
Publicado: (2023)
Energy Efficiency in Rate-Splitting Multiple Access with Mixed Criticality
por: Reifert, Robert-Jeron, et al.
Publicado: (2022)
por: Reifert, Robert-Jeron, et al.
Publicado: (2022)
Ejemplares similares
-
High-Rate Quantized Matrix Multiplication I
por: Ordentlich, Or, et al.
Publicado: (2026) -
High-Rate Quantized Matrix Multiplication II
por: Ordentlich, Or, et al.
Publicado: (2026) -
NestQuant: Nested Lattice Quantization for Matrix Products and LLMs
por: Savkin, Semyon, et al.
Publicado: (2025) -
Optimal Quantization for Matrix Multiplication
por: Ordentlich, Or, et al.
Publicado: (2024) -
The Voronoi Spherical CDF for Lattices and Linear Codes: New Bounds for Quantization and Coding
por: Ordentlich, Or
Publicado: (2025)