This paper analyzes the generalization of minimax regret optimization(MRO)under distribution shift.A new learning framework is proposed by injecting the measure of con-ditional value at risk(CVaR)into MRO,and its gene...This paper analyzes the generalization of minimax regret optimization(MRO)under distribution shift.A new learning framework is proposed by injecting the measure of con-ditional value at risk(CVaR)into MRO,and its generalization error bound is established through the lens of uniform convergence analysis.The CVaR-based MRO can achieve the polynomial decay rate on the excess risk,which extends the generalization analysis associated with the expected risk to the risk-averse case.展开更多
Noise pollution has become increasingly severe around the world due to fast urbanization. How to soundproof windows from outside noise is of significant interest for both academia and industry. This paper reports an e...Noise pollution has become increasingly severe around the world due to fast urbanization. How to soundproof windows from outside noise is of significant interest for both academia and industry. This paper reports an experimental implementation of normalized minmax active noise control (ANC) algorithm on an open window system, where identifying the model of acoustic sound paths plays a central role. By doing this, traffic noise is attenuated by the ANC system, leading to a relatively quiet indoor environment, while the natural lighting and ventilation functions of a window are remained. Our experiments show that an average of 19 dB(A) noise reduction is achieved.展开更多
Path-based clustering algorithms typically generate clusters by optimizing a benchmark function.Most optimiza-tion methods in clustering algorithms often offer solutions close to the general optimal value.This study a...Path-based clustering algorithms typically generate clusters by optimizing a benchmark function.Most optimiza-tion methods in clustering algorithms often offer solutions close to the general optimal value.This study achieves the global optimum value for the criterion function in a shorter time using the minimax distance,Maximum Spanning Tree“MST”,and meta-heuristic algorithms,including Genetic Algorithm“GA”and Particle Swarm Optimization“PSO”.The Fast Path-based Clustering“FPC”algorithm proposed in this paper can find cluster centers correctly in most datasets and quickly perform clustering operations.The FPC does this operation using MST,the minimax distance,and a new hybrid meta-heuristic algorithm in a few rounds of algorithm iterations.This algorithm can achieve the global optimal value,and the main clustering process of the algorithm has a computational complexity of O�k2×n�.However,due to the complexity of the minimum distance algorithm,the total computational complexity is O�n2�.Experimental results of FPC on synthetic datasets with arbitrary shapes demonstrate that the algorithm is resistant to noise and outliers and can correctly identify clusters of varying sizes and numbers.In addition,the FPC requires the number of clusters as the only parameter to perform the clustering process.A comparative analysis of FPC and other clustering algorithms in this domain indicates that FPC exhibits superior speed,stability,and performance.展开更多
In this paper,we study the minimax linear fractional programming problem on a non-empty bounded set,called problem(MLFP),and we design a branch and bound algorithm to find a globally optimal solution of(MLFP).Firstly,...In this paper,we study the minimax linear fractional programming problem on a non-empty bounded set,called problem(MLFP),and we design a branch and bound algorithm to find a globally optimal solution of(MLFP).Firstly,we convert the problem(MLFP)to a problem(EP2)that is equivalent to it.Secondly,by applying the convex relaxation technique to problem(EP2),a convex quadratic relaxation problem(CQRP)is obtained.Then,the overall framework of the algorithm is given and its convergence is proved,the worst-case iteration number is also estimated.Finally,experimental data are listed to illustrate the effectiveness of the algorithm.展开更多
基金Supported by Education Science Planning Project of Hubei Province(2020GB198)Natural Science Foundation of Hubei Province(2023AFB523).
文摘This paper analyzes the generalization of minimax regret optimization(MRO)under distribution shift.A new learning framework is proposed by injecting the measure of con-ditional value at risk(CVaR)into MRO,and its generalization error bound is established through the lens of uniform convergence analysis.The CVaR-based MRO can achieve the polynomial decay rate on the excess risk,which extends the generalization analysis associated with the expected risk to the risk-averse case.
文摘Noise pollution has become increasingly severe around the world due to fast urbanization. How to soundproof windows from outside noise is of significant interest for both academia and industry. This paper reports an experimental implementation of normalized minmax active noise control (ANC) algorithm on an open window system, where identifying the model of acoustic sound paths plays a central role. By doing this, traffic noise is attenuated by the ANC system, leading to a relatively quiet indoor environment, while the natural lighting and ventilation functions of a window are remained. Our experiments show that an average of 19 dB(A) noise reduction is achieved.
文摘Path-based clustering algorithms typically generate clusters by optimizing a benchmark function.Most optimiza-tion methods in clustering algorithms often offer solutions close to the general optimal value.This study achieves the global optimum value for the criterion function in a shorter time using the minimax distance,Maximum Spanning Tree“MST”,and meta-heuristic algorithms,including Genetic Algorithm“GA”and Particle Swarm Optimization“PSO”.The Fast Path-based Clustering“FPC”algorithm proposed in this paper can find cluster centers correctly in most datasets and quickly perform clustering operations.The FPC does this operation using MST,the minimax distance,and a new hybrid meta-heuristic algorithm in a few rounds of algorithm iterations.This algorithm can achieve the global optimal value,and the main clustering process of the algorithm has a computational complexity of O�k2×n�.However,due to the complexity of the minimum distance algorithm,the total computational complexity is O�n2�.Experimental results of FPC on synthetic datasets with arbitrary shapes demonstrate that the algorithm is resistant to noise and outliers and can correctly identify clusters of varying sizes and numbers.In addition,the FPC requires the number of clusters as the only parameter to perform the clustering process.A comparative analysis of FPC and other clustering algorithms in this domain indicates that FPC exhibits superior speed,stability,and performance.
基金Supported by the National Natural Science Foundation of China(Grant Nos.12071133 and 11871196).
文摘In this paper,we study the minimax linear fractional programming problem on a non-empty bounded set,called problem(MLFP),and we design a branch and bound algorithm to find a globally optimal solution of(MLFP).Firstly,we convert the problem(MLFP)to a problem(EP2)that is equivalent to it.Secondly,by applying the convex relaxation technique to problem(EP2),a convex quadratic relaxation problem(CQRP)is obtained.Then,the overall framework of the algorithm is given and its convergence is proved,the worst-case iteration number is also estimated.Finally,experimental data are listed to illustrate the effectiveness of the algorithm.
