Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Search by expertise, name or affiliation
Decentralized online convex optimization with compressed communications
Xuanyu Cao,
Tamer Başar
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Decentralized online convex optimization with compressed communications'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Online Convex Optimization
100%
Compressed Communication
100%
Performance Optimization
66%
Communication Overhead
66%
Online Gradient Descent
66%
Order of Magnitude
33%
Numerical Experiments
33%
Compensation Method
33%
Compress
33%
Further Analysis
33%
Loss Function
33%
Gradient Method
33%
Convex Optimization Problem
33%
Optimization Algorithm
33%
Information Exchange
33%
Scarce Resources
33%
Error Compensation
33%
Vanilla
33%
Compression Operators
33%
Local Loss
33%
Error Accumulation
33%
Regret
33%
Multi-agent Optimization
33%
Communication Bottleneck
33%
Regret Bounds
33%
Decentralized Multi-Agent
33%
Global Loss
33%
Communication Compression
33%
Computer Science
Convex Optimization
100%
Performance Optimization
100%
Communication Overhead
100%
Gradient Descent
100%
Optimization Problem
50%
Optimization Algorithm
50%
multi agent
50%
Transmitted Bit
50%
Mathematics
Numerical Experiment
100%
Minimizes
100%
Loss Function
100%
Choosing Action
100%
Engineering
Gradient Descent
100%
Numerical Experiment
50%
Convex Optimization Problem
50%
Error Compensation
50%
Decentralized Multi
50%
Loss Function
50%
Local Loss
50%