Normalized Maximum Likelihood Code-Length on Riemannian Data Spaces
Fuente:
arXiv
Saved in:
| Main Authors: | Fukuzawa, Kota, Suzuki, Atsushi, Yamanishi, Kenji |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Foundation of Calculating Normalized Maximum Likelihood for Continuous Probability Models
by: Suzuki, Atsushi, et al.
Published: (2024)
by: Suzuki, Atsushi, et al.
Published: (2024)
Graph Community Augmentation with GMM-based Modeling in Latent Space
by: Fukushima, Shintaro, et al.
Published: (2024)
by: Fukushima, Shintaro, et al.
Published: (2024)
Variable-Length Feedback Codes over Known and Unknown Channels with Non-vanishing Error Probabilities
by: Yavas, Recep Can, et al.
Published: (2024)
by: Yavas, Recep Can, et al.
Published: (2024)
Clustering Change Sign Detection by Fusing Mixture Complexity
by: Urano, Kento, et al.
Published: (2024)
by: Urano, Kento, et al.
Published: (2024)
Rotation Invariant Quantization for Model Compression
by: Kampeas, Joseph, et al.
Published: (2023)
by: Kampeas, Joseph, et al.
Published: (2023)
Quantum Maximum Likelihood Prediction via Hilbert Space Embeddings
by: Sreekumar, Sreejith, et al.
Published: (2026)
by: Sreekumar, Sreejith, et al.
Published: (2026)
Partially Polarized Polar Codes: A New Design for 6G Control Channels
by: Fazeli, Arman, et al.
Published: (2026)
by: Fazeli, Arman, et al.
Published: (2026)
Guessing random additive noise decoding with symbol reliability information (SRGRAND)
by: Duffy, Ken R., et al.
Published: (2019)
by: Duffy, Ken R., et al.
Published: (2019)
Some Notes on the Sample Complexity of Approximate Channel Simulation
by: Flamich, Gergely, et al.
Published: (2024)
by: Flamich, Gergely, et al.
Published: (2024)
Algebra in Algorithmic Coding Theory
by: Sudan, Madhu
Published: (2025)
by: Sudan, Madhu
Published: (2025)
Overfitting has a limitation: a model-independent generalization gap bound based on Rényi entropy
by: Suzuki, Atsushi, et al.
Published: (2025)
by: Suzuki, Atsushi, et al.
Published: (2025)
On the Regret of Coded Caching with Adversarial Requests
by: Nayak, Anupam, et al.
Published: (2024)
by: Nayak, Anupam, et al.
Published: (2024)
Locally Optimal Private Sampling: Beyond the Global Minimax
by: Ghoukasian, Hrad, et al.
Published: (2025)
by: Ghoukasian, Hrad, et al.
Published: (2025)
On the Hardness of the One-Sided Code Sparsifier Problem
by: Grigorescu, Elena, et al.
Published: (2025)
by: Grigorescu, Elena, et al.
Published: (2025)
Amortized Locally Decodable Codes for Insertions and Deletions
by: Blocki, Jeremiah, et al.
Published: (2025)
by: Blocki, Jeremiah, et al.
Published: (2025)
Frozen Set Design for Precoded Polar Codes
by: Miloslavskaya, Vera, et al.
Published: (2023)
by: Miloslavskaya, Vera, et al.
Published: (2023)
Identification Under the Semantic Effective Secrecy Constraint
by: Ibrahim, Abdalla, et al.
Published: (2025)
by: Ibrahim, Abdalla, et al.
Published: (2025)
Three classes of propagation rules for generalized Reed-Solomon codes and their applications to EAQECCs
by: Wan, Ruhao, et al.
Published: (2024)
by: Wan, Ruhao, et al.
Published: (2024)
Near-Optimal Weighted Matrix Completion
by: López, Oscar
Published: (2022)
by: López, Oscar
Published: (2022)
Several new classes of MDS symbol-pair codes derived from matrix-product codes
by: Zheng, Xiujing, et al.
Published: (2024)
by: Zheng, Xiujing, et al.
Published: (2024)
Third-order Analysis of Channel Coding in the Small-to-Moderate Deviations Regime
by: Yavas, Recep Can, et al.
Published: (2022)
by: Yavas, Recep Can, et al.
Published: (2022)
Out-of-Distribution Detection using Maximum Entropy Coding
by: Abolfazli, Mojtaba, et al.
Published: (2024)
by: Abolfazli, Mojtaba, et al.
Published: (2024)
A Logarithmic Decomposition and a Signed Measure Space for Entropy
by: Down, Keenan J. A., et al.
Published: (2024)
by: Down, Keenan J. A., et al.
Published: (2024)
Tensor Generalized Approximate Message Passing
by: Li, Yinchuan, et al.
Published: (2025)
by: Li, Yinchuan, et al.
Published: (2025)
Quad Length Codes for Lossless Compression of e4m3
by: Agrawal, Aditya, et al.
Published: (2026)
by: Agrawal, Aditya, et al.
Published: (2026)
Actions Speak Louder Than Words: Rate-Reward Trade-off in Markov Decision Processes
by: Wu, Haotian, et al.
Published: (2025)
by: Wu, Haotian, et al.
Published: (2025)
Online Clustering of Data Sequences with Bandit Information
by: Chandran, G Dhinesh, et al.
Published: (2025)
by: Chandran, G Dhinesh, et al.
Published: (2025)
Amortized Locally Decodable Codes
by: Blocki, Jeremiah, et al.
Published: (2025)
by: Blocki, Jeremiah, et al.
Published: (2025)
Sensor Design for Accuracy-Bounded Estimation via Maximum-Entropy Likelihood Synthesis
by: Bhattacharya, Raktim
Published: (2026)
by: Bhattacharya, Raktim
Published: (2026)
Maximally Extendable Product Codes are Good Coboundary Expanders
by: Kalachev, Gleb, et al.
Published: (2025)
by: Kalachev, Gleb, et al.
Published: (2025)
Sequence of Numbers of Linear Codes with Increasing Hull Dimensions
by: Bouyuklieva, Stefka, et al.
Published: (2024)
by: Bouyuklieva, Stefka, et al.
Published: (2024)
Accelerating Relative Entropy Coding with Space Partitioning
by: He, Jiajun, et al.
Published: (2024)
by: He, Jiajun, et al.
Published: (2024)
Divisibility of Trace Codes
by: Huang, Hexiang, et al.
Published: (2026)
by: Huang, Hexiang, et al.
Published: (2026)
Multi-Twisted Generalized Reed-Solomon Codes: Structure, Properties, and Constructions
by: Liang, Zhonghao, et al.
Published: (2025)
by: Liang, Zhonghao, et al.
Published: (2025)
Several classes of three-weight or four-weight linear codes
by: Liao, Qunying, et al.
Published: (2025)
by: Liao, Qunying, et al.
Published: (2025)
On the Ding and Helleseth's 9th open problem about optimal ternary cyclic codes
by: Zheng, Peipei, et al.
Published: (2025)
by: Zheng, Peipei, et al.
Published: (2025)
Four classes of LCD codes from (*)-(L,P)-twisted generalized Reed-Solomon codes
by: Liang, Zhonghao, et al.
Published: (2025)
by: Liang, Zhonghao, et al.
Published: (2025)
Sketching sparse low-rank matrices with near-optimal sample- and time-complexity using message passing
by: Liu, Xiaoqi, et al.
Published: (2022)
by: Liu, Xiaoqi, et al.
Published: (2022)
Spectral Gap-Based Seismic Survey Design
by: López, Oscar, et al.
Published: (2022)
by: López, Oscar, et al.
Published: (2022)
Non-GRS type Euclidean and Hermitian LCD codes and Their Applications for EAQECCs
by: Liang, Zhonghao, et al.
Published: (2026)
by: Liang, Zhonghao, et al.
Published: (2026)
Similar Items
-
Foundation of Calculating Normalized Maximum Likelihood for Continuous Probability Models
by: Suzuki, Atsushi, et al.
Published: (2024) -
Graph Community Augmentation with GMM-based Modeling in Latent Space
by: Fukushima, Shintaro, et al.
Published: (2024) -
Variable-Length Feedback Codes over Known and Unknown Channels with Non-vanishing Error Probabilities
by: Yavas, Recep Can, et al.
Published: (2024) -
Clustering Change Sign Detection by Fusing Mixture Complexity
by: Urano, Kento, et al.
Published: (2024) -
Rotation Invariant Quantization for Model Compression
by: Kampeas, Joseph, et al.
Published: (2023)