Convex
【五期李伟平】CCF-A（S&P'20）The Value of Collaboration in Convex Machine Learning with Differential Privacy
Nan W., et al. “The Value of Collaboration in Convex Machine Learning with Differential Privacy.” 2020 IEEE Symposium on Security and Privacy. 304-317 ......
《convex optimization》——Stanford University open class
20231215 1. Introduction mathematical optimization least-squares and linear programing convex optimization exapmle course goals and topics nonlinear o ......
[AGC049D] Convex Sequence 题解
题目链接 点击打开链接 题目解法 好题！！ 考虑原题的限制相当于原序列下凸，即差分数组单调 考虑把原序列在第一个最小值处割成 \(2\) 半 因为原序列是凸的，所以非最小值的长度是 \(\sqrt {2m}\) 级别的 这可以让我们 \(dp\) 差分数组，即求满足 \(\sum\limits_{i ......
Exploring Recursion in Convex Optimization
Recursion in optimization In this blog post, I aim to provide a overview of the various recursive methods I have seen in convex optimization. Optimiza ......
Convex Functions
1. Basic properties and examples 1.1 Definitions A function \(f:\R^n\rarr\R\) is convex if \(\mathrm{\textbf{dom}}\ f\) is a convex set and if for a ......
Convex Sets
1. Affine and convex sets 1.1 Affine sets A set \(C\in\R^n\) is affine if the line through any two distinct points in \(C\) lies in \(C\), which mea ......
definition of the convex optimization
A convex optimization problem is one in which the objective and constraint functions are convex, which means they satisfy the inequality \(f_i(\alpha ......
AGC049D Convex Sequence 题解
题意 若非负数列 \(A\) 中任意 \(i(2 \leq i \leq N-1)\) ，都有 \(2A_i \leq A_{i-1} + A_{i+1}\)，则称 \(A\) 为凸数列。 问长为 \(N\) ，且数列中所有项的和为 \(M\) 的凸数列有多少个，答案对 \(10^9+7\) 取模。 ......
AGC049D Convex Sequence 题解
题意 若非负数列 \(A\) 中任意 \(i(2 \leq i \leq N-1)\) ，都有 \(2A_i \leq A_{i-1} + A_{i+1}\)，则称 \(A\) 为凸数列。 问长为 \(N\) ，且数列中所有项的和为 \(M\) 的凸数列有多少个，答案对 \(10^9+7\) 取模。 ......
【笔记】凸优化 Convex Optimization
## Differentiation **Def. Gradient** $f:{\cal X}\sube\mathbb{R} ^N\to \mathbb{R}$ is *differentiable*. Then the *gradient* of $f$ at ${\bf x}\in\cal{X ......
Comparing with traditional convex optimization methodology, what are advantages of PSO algorithm
与传统的凸优化方法相比，粒子群算法有哪些优点 与传统的凸优化方法相比，粒子群优化（PSO）算法具有以下优点： 全局搜索能力：PSO算法具有较强的全局搜索能力，能够在多个解空间中寻找最优解。由于粒子群在搜索过程中可以通过信息共享和合作，有助于避免陷入局部最优解。 适应性和自适应性：PSO算法具有适应性 ......
凹度（concavity）和凸包（convex hull）
Mask concavity： 在语义分割问题中，mask凹度是指形状或物体的**凹陷程度**的术语。 它的计算方法是从mask凸包（convex hull）的**面积**中减去mask的**面积**并除以后者。 凸包是包含掩码的最小凸形。 ¹² mask凹度的范围可以从 0 到 1，其中 0 表示 ......
May 2022-Neighborhood Mixup Experience Replay: Local Convex Interpolation for Improved Sample Efficiency in Continuous Control Tasks
提出了邻域混合经验回放(NMER)，一种基于几何的回放缓冲区，用状态-动作空间中最近邻的transition进行插值。NMER仅通过混合transition与邻近状态-动作特征来保持trnaistion流形的局部线性近似。 ......