发布求助
文献互助 智能选刊 最新文献

Journal of Complexity最新文献

筛选
英文 中文
A duality approach to regularized learning problems in Banach spaces 巴拿赫空间正则化学习问题的对偶方法
IF 1.7 2区 数学
Journal of Complexity Pub Date : 2023-12-15 DOI: 10.1016/j.jco.2023.101818
Raymond Cheng , Rui Wang , Yuesheng Xu
{"title":"A duality approach to regularized learning problems in Banach spaces","authors":"Raymond Cheng ,&nbsp;Rui Wang ,&nbsp;Yuesheng Xu","doi":"10.1016/j.jco.2023.101818","DOIUrl":"10.1016/j.jco.2023.101818","url":null,"abstract":"<div><p><span>Regularized learning problems in Banach spaces, which often minimize the sum of a data fidelity term in one Banach norm and a </span>regularization<span><span> term in another Banach norm, is challenging to solve. We construct a direct sum space based on the Banach spaces for the fidelity term and the regularization term, and recast the objective function as the norm of a quotient space of the direct sum space. We then express the original regularized problem as an optimization problem in the dual space of the direct sum space. It is to find the maximum of a linear function on a convex polytope, which may be solved by linear programming. A solution of the original problem is then obtained by using related </span>extremal properties of norming functionals from a solution of the dual problem. Numerical experiments demonstrate that the proposed duality approach is effective for solving the regularization learning problems.</span></p></div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"81 ","pages":"Article 101818"},"PeriodicalIF":1.7,"publicationDate":"2023-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138681684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimal recovery and volume estimates 最佳恢复和容量估计
IF 1.7 2区 数学
Journal of Complexity Pub Date : 2023-12-01 DOI: 10.1016/j.jco.2023.101780
A. Kushpel
{"title":"Optimal recovery and volume estimates","authors":"A. Kushpel","doi":"10.1016/j.jco.2023.101780","DOIUrl":"https://doi.org/10.1016/j.jco.2023.101780","url":null,"abstract":"","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"177 1","pages":"101780"},"PeriodicalIF":1.7,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"54746253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The rate of convergence for sparse and low-rank quantile trace regression 稀疏和低秩分位数迹回归的收敛速度
IF 1.7 2区 数学
Journal of Complexity Pub Date : 2023-12-01 DOI: 10.1016/j.jco.2023.101778
Xiangyong Tan, Ling Peng, Peiwen Xiao, Qing Liu, Xiaohui Liu
{"title":"The rate of convergence for sparse and low-rank quantile trace regression","authors":"Xiangyong Tan, Ling Peng, Peiwen Xiao, Qing Liu, Xiaohui Liu","doi":"10.1016/j.jco.2023.101778","DOIUrl":"https://doi.org/10.1016/j.jco.2023.101778","url":null,"abstract":"","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"79 1","pages":"101778"},"PeriodicalIF":1.7,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"54746217","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Changes of the Editorial Board 编辑委员会的变动
IF 1.7 2区 数学
Journal of Complexity Pub Date : 2023-12-01 DOI: 10.1016/j.jco.2023.101792
Eric Novak
{"title":"Changes of the Editorial Board","authors":"Eric Novak","doi":"10.1016/j.jco.2023.101792","DOIUrl":"https://doi.org/10.1016/j.jco.2023.101792","url":null,"abstract":"","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"206 1","pages":"101792"},"PeriodicalIF":1.7,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"54746309","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the complexity of a unified convergence analysis for iterative methods 关于复杂性的一种统一收敛分析迭代方法
IF 1.7 2区 数学
Journal of Complexity Pub Date : 2023-12-01 DOI: 10.1016/j.jco.2023.101781
I. Argyros, S. Shakhno, Samundra Regmi, H. Yarmola
{"title":"On the complexity of a unified convergence analysis for iterative methods","authors":"I. Argyros, S. Shakhno, Samundra Regmi, H. Yarmola","doi":"10.1016/j.jco.2023.101781","DOIUrl":"https://doi.org/10.1016/j.jco.2023.101781","url":null,"abstract":"","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"79 1","pages":"101781"},"PeriodicalIF":1.7,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"54746283","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On a unified convergence analysis for Newton-type methods solving generalized equations with the Aubin property 求解具有Aubin性质的广义方程的牛顿型方法的统一收敛性分析
IF 1.7 2区 数学
Journal of Complexity Pub Date : 2023-11-22 DOI: 10.1016/j.jco.2023.101817
Ioannis K. Argyros , Santhosh George
{"title":"On a unified convergence analysis for Newton-type methods solving generalized equations with the Aubin property","authors":"Ioannis K. Argyros ,&nbsp;Santhosh George","doi":"10.1016/j.jco.2023.101817","DOIUrl":"https://doi.org/10.1016/j.jco.2023.101817","url":null,"abstract":"<div><p>A plethora of applications from diverse disciplines reduce to solving generalized equations involving Banach space<span> valued operators. These equations are solved mostly iteratively, when a sequence is generated approximating a solution provided that certain conditions are valid on the starting point and the operators appearing on the method. Secant-type methods are developed whose specializations reduce to well known methods such as Newton, modified Newton, Secant<span>, Kurchatov and Steffensen<span><span> to mention a few. Unified local as well as semi-local analysis of these methods is presented using the celebrated contraction mapping principle in combination with the Aubin property of a set valued operator, and generalized continuity assumption on the operators on these methods. </span>Numerical applications complement the theory.</span></span></span></p></div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"81 ","pages":"Article 101817"},"PeriodicalIF":1.7,"publicationDate":"2023-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138471557","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimal recovery and generalized Carlson inequality for weights with symmetry properties 对称权的最优恢复与广义Carlson不等式
IF 1.7 2区 数学
Journal of Complexity Pub Date : 2023-11-07 DOI: 10.1016/j.jco.2023.101807
K.Yu. Osipenko
{"title":"Optimal recovery and generalized Carlson inequality for weights with symmetry properties","authors":"K.Yu. Osipenko","doi":"10.1016/j.jco.2023.101807","DOIUrl":"https://doi.org/10.1016/j.jco.2023.101807","url":null,"abstract":"<div><p>The paper concerns problems of the recovery of operators from noisy information in weighted<!--> <span><math><msub><mrow><mi>L</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span>-spaces<!--> <!-->with<!--> <!-->homogeneous<!--> <!-->weights. A number of general theorems are proved and applied to finding exact constants in multidimensional Carlson type inequalities with several weights and problems of the recovery of differential operators from a noisy Fourier transform. In particular, optimal methods are obtained for the recovery of powers of generalized Laplace operators from a noisy Fourier transform in the <span><math><msub><mrow><mi>L</mi></mrow><mrow><mi>p</mi></mrow></msub></math></span>-metric.</p></div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"81 ","pages":"Article 101807"},"PeriodicalIF":1.7,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92121785","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Changes of the Editorial Board 编辑委员会的变动
IF 1.7 2区 数学
Journal of Complexity Pub Date : 2023-10-20 DOI: 10.1016/j.jco.2023.101806
Erich Novak
{"title":"Changes of the Editorial Board","authors":"Erich Novak","doi":"10.1016/j.jco.2023.101806","DOIUrl":"https://doi.org/10.1016/j.jco.2023.101806","url":null,"abstract":"","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"80 ","pages":"Article 101806"},"PeriodicalIF":1.7,"publicationDate":"2023-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49887913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award katyna Pozharska是2023年Joseph F. Traub信息复杂性青年研究员奖的获得者
IF 1.7 2区 数学
Journal of Complexity Pub Date : 2023-10-20 DOI: 10.1016/j.jco.2023.101805
David Krieg, Erich Novak, Mathias Sonnleitner, Michaela Szölgyenyi, Henryk Woźniakowski
{"title":"Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award","authors":"David Krieg,&nbsp;Erich Novak,&nbsp;Mathias Sonnleitner,&nbsp;Michaela Szölgyenyi,&nbsp;Henryk Woźniakowski","doi":"10.1016/j.jco.2023.101805","DOIUrl":"https://doi.org/10.1016/j.jco.2023.101805","url":null,"abstract":"","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"80 ","pages":"Article 101805"},"PeriodicalIF":1.7,"publicationDate":"2023-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49887912","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Nonexact oracle inequalities, r-learnability, and fast rates 非精确oracle不等式、r-learnability和快速速率
IF 1.7 2区 数学
Journal of Complexity Pub Date : 2023-10-13 DOI: 10.1016/j.jco.2023.101804
Daniel Z. Zanger
{"title":"Nonexact oracle inequalities, r-learnability, and fast rates","authors":"Daniel Z. Zanger","doi":"10.1016/j.jco.2023.101804","DOIUrl":"https://doi.org/10.1016/j.jco.2023.101804","url":null,"abstract":"<div><p>As an extension of the standard paradigm in statistical learning theory, we introduce the concept of <em>r</em>-learnability, <span><math><mn>0</mn><mo>&lt;</mo><mi>r</mi><mo>≤</mo><mn>1</mn></math></span>, which is a notion very closely related to that of nonexact oracle inequalities (see Lecue and Mendelson (2012) <span>[7]</span>). The <em>r</em>-learnability concept can enable so-called fast learning rates (along with corresponding sample complexity-type bounds) to be established at the cost of multiplying the approximation error term by an extra <span><math><mo>(</mo><mn>1</mn><mo>+</mo><mi>r</mi><mo>)</mo></math></span>-factor in the learning error estimate. We establish a new, general <em>r</em>-learning bound (nonexact oracle inequality) yielding fast learning rates in probability (up to at most a logarithmic factor) for proper learning in the general setting of an agnostic model, essentially only assuming a uniformly bounded squared loss function and a hypothesis class of finite VC-dimension (that is, finite pseudo-dimension).</p></div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"80 ","pages":"Article 101804"},"PeriodicalIF":1.7,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49887911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信