首页/论文/0803.2091

arXiv 0803.20912008-03math.OC

Properties and applications of dual reduction

Yannick Viossat

备注：: This is a revised version of the cahier du laboratoire d'économétrie 2003-31

英文摘要：

The dual reduction process, introduced by Myerson, allows to reduce a finite game into a smaller dimensional game such that any equilibrium of the reduced game is an equilibrium of the original game. This holds both for Nash equilibrium and correlated equilibrium. We present examples of applications of dual reduction and argue that this is a useful tool to study Nash equilibria and correlated equilibria. We then investigate its properties.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Strong duality in conic linear programming: facial reduction and extended duals

The facial reduction algorithm of Borwein and Wolkowicz and the extended dual of Ramana provide a strong dual for the conic linear program $$ (P) \sup {<c, x> | Ax \leq_K b} $$ in the absence of any constraint qualification. The facial reduction algorithm solves a sequence of auxiliary optimization problems to obtain such a dual. Ramana's dual is applicable when (P) is a semidefinite program (SDP) and is an explicit SDP itself. Ramana, Tuncel, and Wolkowicz showed that these approaches are closely related; in particular, they proved the correctness of Ramana's dual using certificates from a fa…

2013-07-19math.OC

The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis

We revisit the operator splitting schemes proposed in a recent work of [Some extensions of the operator splitting schemes based on Lagrangian and primal-dual: A unified proximal point analysis, Feng Xue, Optimization, 2022, doi: 10.1080/02331934.2022.2057309], and further analyze the convergence of the generalized Bregman distance and the primal-dual gap of these algorithms within a unified proximal point framework. The possibility of reduction to a simple resolvent is also discussed by exploiting the structure and possible degeneracy of the underlying metric.

2023-02-19math.OC

适应性维度约简用于重叠组稀疏性

Adaptive Dimension Reduction for Overlapping Group Sparsity

本文提出了一种新的自适应方案，用于加速现有算法在重叠组LASSO中的应用，同时提供了收敛性分析和实验验证。

2026-01-28math.OC

A Stochastic Variance Reduction Algorithm with Bregman Distances for Structured Composite Problems

We develop a novel stochastic primal dual splitting method with Bregman distances for solving a structured composite problems involving infimal convolutions in non-Euclidean spaces. The sublinear convergence in expectation of the primal-dual gap is proved under mild conditions on stepsize for the general case. The linear convergence rate is obtained under additional condition like the strong convexity relative to Bregman functions.

2021-03-16math.OC

Dual-Free Stochastic Decentralized Optimization with Variance Reduction

We consider the problem of training machine learning models on distributed data in a decentralized way. For finite-sum problems, fast single-machine algorithms for large datasets rely on stochastic updates combined with variance reduction. Yet, existing decentralized stochastic algorithms either do not obtain the full speedup allowed by stochastic updates, or require oracles that are more expensive than regular gradients. In this work, we introduce a Decentralized stochastic algorithm with Variance Reduction called DVR. DVR only requires computing stochastic gradients of the local functions, a…

2020-06-25cs.DCmath.OC

Drago：用于加速分布式鲁棒优化的原对偶耦合方差减少

Drago: Primal-Dual Coupled Variance Reduction for Faster Distributionally Robust Optimization

University of Washington（华盛顿大学）；University of Wisconsin（威斯康星大学）

针对含闭合凸不确定性集的惩罚分布式鲁棒优化（DRO）问题，提出随机原对偶算法Drago，结合循环与随机组件及正则化原更新实现对偶方差减少，在强凸-强凹DRO问题上获线性收敛速率，数值基准验证了理论结果。

2025-02-11cs.LGmath.OCstat.ML

更多相关论文收起更多论文

Stochastic dual averaging methods using variance reduction techniques for regularized empirical risk minimization problems

Tokyo Institute of Technology（东京工业大学）；Japan Science and Technology Agency（日本科学技术振兴机构）

We consider a composite convex minimization problem associated with regularized empirical risk minimization, which often arises in machine learning. We propose two new stochastic gradient methods that are based on stochastic dual averaging method with variance reduction. Our methods generate a sparser solution than the existing methods because we do not need to take the average of the history of the solutions. This is favorable in terms of both interpretability and generalization. Moreover, our methods have theoretical support for both a strongly and a non-strongly convex regularizer and achie…

2016-03-08cs.LGmath.OCstat.ML

Variance Reduction via Primal-Dual Accelerated Dual Averaging for Nonsmooth Convex Finite-Sums

University of Wisconsin-Madison（威斯康星大学麦迪逊分校）

We study structured nonsmooth convex finite-sum optimization that appears widely in machine learning applications, including support vector machines and least absolute deviation. For the primal-dual formulation of this problem, we propose a novel algorithm called \emph{Variance Reduction via Primal-Dual Accelerated Dual Averaging (\vrpda)}. In the nonsmooth and general convex setting, \vrpda~has the overall complexity $O(nd\log\min \{1/ε, n\} + d/ε)$ in terms of the primal-dual gap, where $n$ denotes the number of samples, $d$ the dimension of the primal variables, and $ε$ the desired accuracy…

2021-04-07cs.LGcs.NAmath.NA

Variance Reduction via Accelerated Dual Averaging for Finite-Sum Optimization

Tsinghua-Berkeley Shenzhen Institute, Tsinghua University（清华大学-伯克利深圳学院，清华大学）；University of California, Berkeley（加利福尼亚大学伯克利分校）

In this paper, we introduce a simplified and unified method for finite-sum convex optimization, named \emph{Variance Reduction via Accelerated Dual Averaging (VRADA)}. In both general convex and strongly convex settings, VRADA can attain an $O\big(\frac{1}{n}\big)$-accurate solution in $O(n\log\log n)$ number of stochastic gradient evaluations which improves the best-known result $O(n\log n)$, where $n$ is the number of samples. Meanwhile, VRADA matches the lower bound of the general convex setting up to a $\log\log n$ factor and matches the lower bounds in both regimes $n\le Θ(κ)$ and $n\gg κ…

2021-03-07cs.LGmath.OC

Active Uncertainty Reduction for Human-Robot Interaction: An Implicit Dual Control Approach

Princeton University（普林斯顿大学）

The ability to accurately predict human behavior is central to the safety and efficiency of robot autonomy in interactive settings. Unfortunately, robots often lack access to key information on which these predictions may hinge, such as people's goals, attention, and willingness to cooperate. Dual control theory addresses this challenge by treating unknown parameters of a predictive model as stochastic hidden states and inferring their values at runtime using information gathered during system operation. While able to optimally and automatically trade off exploration and exploitation, dual con…

2022-06-05cs.LGcs.ROcs.SY

基于方差缩减的策略性原始-对偶方法用于凹约束马尔可夫决策过程

Policy-based Primal-Dual Methods for Concave CMDP with Variance Reduction

Department of Industrial Engineering and Operations Research, UC Berkeley（加州大学伯克利分校工业工程与运筹学系）；Department of Mechanical Engineering, UC Berkeley（加州大学伯克利分校机械工程系）

针对凹约束马尔可夫决策过程，提出方差缩减的原始-对偶策略梯度算法，利用隐藏凹性实现全局收敛，并证明其收敛速率与样本复杂度，通过悲观项实现零约束违反。

2024-05-26cs.LGmath.OC

面向安全高效交互规划的主动不确定性消减：一种屏蔽感知的双控制方法

Active Uncertainty Reduction for Safe and Efficient Interaction Planning: A Shielding-Aware Dual Control Approach

Princeton University（普林斯顿大学）；Honda Research Institute（本田研究院）

本文提出一种基于隐式双控制和采样近似随机动态规划的交互式运动规划方法，结合改进的屏蔽感知鲁棒规划，在连续与类别不确定性下主动消减不确定性并保障安全，通过仿真和1/10比例自动驾驶车辆硬件实验验证其有效性。

2023-11-01cs.LGcs.ROcs.SY