Iterative minimization algorithm on a mixture family

DOI10.1007/S41884-024-00140-5MaRDI QIDQ7267406zbMATH OpenFDO

Authors Masahito Hayashi

Publication date 16 June 2026

Published in Information Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S41884-024-00140-5

zbMATH Keywords

channel capacitydivergenceEM algorithmminimizationmixture family

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx) Mathematical programming (90Cxx) Information theory (general) (94A15)

Cites work

• \alpha-Divergence Is Unique, Belonging to Both f-Divergence and Bregman Divergence Classes
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A Mathematical Theory of Communication
• A modified EM algorithm for mixture models based on Bregman divergence
• A new class of stochastic EM algorithms. Escaping local maxima and handling intractable sampling
• A simple convergence analysis of Bregman proximal gradient algorithm
• A simplified view of first order methods for optimization
• Almost independence of random variables and capacity of a secrecy channel
• An algorithm for computing the capacity of arbitrary discrete memoryless channels
• Bregman Divergence Based Em Algorithm and its Application to Classical and Quantum Rate Distortion Theory
• Broadcast channels with confidential messages
• Commitment capacity of classical-quantum channels
• Computation of channel capacity and rate-distortion functions
• Computing Quantum Channel Capacities
• Computing the channel capacity and rate-distortion function with two-sided state information
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Convergence of Proximal-Like Algorithms
• Cryptography and Coding
• Efficient Approximation of Quantum Channel Capacities
• Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification
• First-order methods in optimization
• General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel
• Geometry of Arimoto algorithm
• Gradient methods for minimizing composite functions
• scientific article; zbMATH DE number 3850830 (Why is no real title available?)
• scientific article; zbMATH DE number 3872359 (Why is no real title available?)
• scientific article; zbMATH DE number 1560711 (Why is no real title available?)
• scientific article; zbMATH DE number 1756451 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 3316587 (Why is no real title available?)
• Information geometry and its applications
• Interior Gradient and Proximal Methods for Convex and Conic Optimization
• Introductory lectures on convex optimization. A basic course.
• On the computation of rate-distortion functions (Corresp.)
• On the converse to the coding theorem for discrete memoryless channels (Corresp.)
• Quantum Information Theory
• Quantum Wiretap Channel With Non-Uniform Random Number and Its Exponent and Equivocation Rate of Leaked Information
• Secure List Decoding and its Application to Bit-String Commitment
• Secure Multiplex Coding With Dependent and Non-Uniform Multiple Messages
• Semantic security for the wiretap channel
• The capacity of the quantum channel with general signal states
• The deterministic information bottleneck
• The Wire-Tap Channel

This page was built for publication: Iterative minimization algorithm on a mixture family

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7267406)