Chrome Extension
WeChat Mini Program
Use on ChatGLM

On Max- K -Sums

Mathematical programming(2017)

School of Operations Research and Information Engineering

Cited 5|Views16
Abstract
The max- k -sum of a set of real scalars is the maximum sum of a subset of size k , or alternatively the sum of the k largest elements. We study two extensions: first, we show how to obtain smooth approximations to functions that are pointwise max- k -sums of smooth functions. Second, we discuss how the max- k -sum can be defined on vectors in a finite-dimensional real vector space ordered by a closed convex cone.
More
Translated text
Key words
Pointwise maximum,Smoothing,Max-k-sums,complexity,Partially ordered
PDF
Bibtex
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Related Papers

Rankmax: an Adaptive Projection Alternative to the Softmax Function.

ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020 2020

被引用19

Differentiable Curl-Noise: Boundary-Respecting Procedural Incompressible Flows Without Discontinuities

Xinwen Ding,Christopher Batty
PROCEEDINGS OF THE ACM ON COMPUTER GRAPHICS AND INTERACTIVE TECHNIQUES 2023

被引用2

Differentiable Curl-Noise

Xinwen Ding,Christopher Batty
Proceedings of the ACM on Computer Graphics and Interactive Techniques 2023

被引用0

Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn
Chat Paper

要点】:本文研究了max-k-sum的两个扩展:一是对点态max-k-sum的平滑函数进行平滑近似,二是将max-k-sum定义在有限维实向量空间中并有序闭凸锥。

方法】:作者通过数学分析和构造性方法,首先对max-k-sum函数进行平滑近似,然后扩展到向量空间中,并利用闭凸锥的性质进行定义。

实验】:本文未具体提及实验内容和数据集名称,主要侧重于理论研究和数学证明。