Filters








86 Hits in 6.9 sec

Genetic and Simulated Annealing Algorithms-based Traffic State Identification

Yuan Yuan, Chunfu Shao, Shiping Zhang, Lamtam Mei
2018 IOP Conference Series: Earth and Environment  
Research results show that, Compared with FCM algorithm and GA-FCM algorithm, SAGA-FCM clustering algorithm can be more effective and fast convergence, so as to improve the accuracy of urban traffic state  ...  We proposed SAGA-FCM clustering algorithm which is combined simulated annealing algorithm (SA) with genetic algorithm (GA) for urban expressway traffic state identification.  ...  Acknowledgements This paper was supported by the Hebei Natural Science Foundation of China (No. E2016513016).  ... 
doi:10.1088/1755-1315/170/3/032117 fatcat:envftdlav5bm3dxmsahgpjg24a

Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimization [article]

Pan Xu and Jinghui Chen and Difan Zou and Quanquan Gu
2020 arXiv   pre-print
Our theoretical analyses shed some light on using Langevin dynamics based algorithms for nonconvex optimization with provable guarantees.  ...  Specifically, we show that gradient Langevin dynamics (GLD) and stochastic gradient Langevin dynamics (SGLD) converge to the almost minimizer within Õ(nd/(λϵ) ) and Õ(d^7/(λ^5ϵ^5) ) stochastic gradient  ...  In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pages 1195-1199, 2017.  ... 
arXiv:1707.06618v3 fatcat:ron6imxljbgwrelspvctnkyuey

An 𝒪(m/ε^3.5)-Cost Algorithm for Semidefinite Programs with Diagonal Constraints [article]

Yin Tat Lee, Swati Padmanabhan
2021 arXiv   pre-print
We obtain this run time via the stochastic variance reduction framework applied to the Arora-Kale algorithm, by constructing a constant-accuracy estimator to maintain the primal iterates.  ...  This problem class appears in combinatorial optimization and has a wide range of engineering applications such as in circuit design, channel assignment in wireless networks, phase recovery, covariance  ...  In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS’05), pages 339–348. IEEE, 2005. 1.1 [AK07] Sanjeev Arora and Satyen Kale.  ... 
arXiv:1903.01859v2 fatcat:wl4jzbxrrjhk7onzfefrcmpwxu

Improved Zeroth-Order Variance Reduced Algorithms and Analysis for Nonconvex Optimization [article]

Kaiyi Ji, Zhe Wang, Yi Zhou, Yingbin Liang
2019 arXiv   pre-print
Two types of zeroth-order stochastic algorithms have recently been designed for nonconvex optimization respectively based on the first-order techniques SVRG and SARAH/SPIDER.  ...  In this paper, we propose a new algorithm ZO-SVRG-Coord-Rand and develop a new analysis for an existing ZO-SVRG-Coord algorithm proposed in Liu et al. 2018b, and show that both ZO-SVRG-Coord-Rand and ZO-SVRG-Coord  ...  National Science Foundation under the grants CCF-1761506 and CCF-1801855.  ... 
arXiv:1910.12166v1 fatcat:sbdev3mvdze6pbxwthdkwdtzmm

Bioinspired Bare Bones Mayfly Algorithm for Large-Scale Spherical Minimum Spanning Tree

Tian Zhang, Yongquan Zhou, Guo Zhou, Wu Deng, Qifang Luo
2022 Frontiers in Bioengineering and Biotechnology  
Mayfly algorithm (MA) is a bioinspired algorithm based on population proposed in recent years and has been applied to many engineering problems successfully.  ...  By comparing and analyzing the results of BBMA and other swarm intelligence algorithms in sixteen scales, the experimental results illustrate that the proposed algorithm is superior to other algorithms  ...  “Firefly Algorithms for Multimodal Optimization,” in Stochastic Algorithms: Foundations and Applications. SAGA 2009.  ... 
doi:10.3389/fbioe.2022.830037 pmid:35299639 pmcid:PMC8921777 fatcat:44bt6fs4l5cita6i37ffd4vure

Parameters Optimization of Taguchi Method Integrated Hybrid Harmony Search Algorithm for Engineering Design Problems

Esra Uray, Serdar Carbas, Zong Woo Geem, Sanghun Kim
2022 Mathematics  
This study focuses on the statistical investigation of the optimum values for the control parameters of the harmony search algorithm and their effects on the best solution.  ...  However, increasing robustness and effectiveness of an optimization algorithm may be possible statistically by estimating proper algorithm parameters values.  ...  SAGA 2009: Stochastic Algorithms: Foundations and Applications; Watanabe, O., Zeugmann, T., Eds.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2009; Volume 5792, pp  ... 
doi:10.3390/math10030327 fatcat:ntbwi4zuevgflgp2boxqekkypa

Overfitting, robustness, and malicious algorithms: A study of potential causes of privacy risk in machine learning

Samuel Yeom, Irene Giacomelli, Alan Menaged, Matt Fredrikson, Somesh Jha
2019 Journal of Computer Security  
Using both formal and empirical analyses, we illustrate a clear relationship between these factors and the privacy risk that arises in several popular machine learning algorithms.  ...  and integrity attacks.  ...  Acknowledgments The authors would like to thank the anonymous reviewers at the IEEE Computer Security Foundations Symposium (CSF) and the Journal of Computer Security for their thoughtful feedback.  ... 
doi:10.3233/jcs-191362 fatcat:lsze3wry4rhi3a6kjkqxkqsjc4

Stochastic Iterative Hard Thresholding for Graph-structured Sparsity Optimization [article]

Baojian Zhou, Feng Chen, Yiming Ying
2019 arXiv   pre-print
We conduct extensive experiments to show the efficiency and effectiveness of the proposed algorithms.  ...  However, these norms cannot be directly applied to the problem of complex (non-convex) graph-structured sparsity models, which have important application in disease outbreak and social networks, etc.  ...  The work of Yiming Ying is supported by the National Science Foundation (NSF) under Grant No #1816227. Baojian Zhou would like to thank Lin Xiao for her valuable proofreading on a draft of the paper.  ... 
arXiv:1905.03652v1 fatcat:vgpxx7yh3vg4tdyug5s5qijerm

Solving Empirical Risk Minimization in the Current Matrix Multiplication Time [article]

Yin Tat Lee, Zhao Song, Qiuyi Zhang
2019 arXiv   pre-print
Our algorithm proposes two concepts which are different from [Cohen, Lee, Song'19] : ∙ We give a robust deterministic central path method, whereas the previous one is a stochastic central path which updates  ...  Many convex problems in machine learning and computer science share the same form: _x∑_i f_i( A_i x + b_i), where f_i are convex functions on R^n_i with constant n_i, A_i ∈R^n_i × d, b_i ∈R^n_i and ∑_i  ...  Acknowledgments The authors would like to thank Haotian Jiang, Swati Padmanabhan, Ruoqi Shen, Zhengyu Wang, Xin Yang and Peilin Zhong for useful discussions.  ... 
arXiv:1905.04447v1 fatcat:nw4kbjalanhetohcm7p335e7ke

Voronoi diagrams – inventor, method, applications

Wojciech Pokojski, Paulina Pokojska
2018 Polish Cartographical Review  
In the digital age this method and its modifications found new applications.  ...  The article presents application of the method in the most popular computer programs from the Geographic Information System (GIS) group and presents examples of its usage in research on geographic space  ...  Implementation of Voronoi diagrams in GIS applications Not many methods and algorithms programmed in GIS are named after their inventors.  ... 
doi:10.2478/pcr-2018-0009 fatcat:sjwfsej7wva6tniuei4h3diaya

2001 MRS Fall Meeting Highlights Innovations in Materials Research

2002 MRS bulletin  
Symposium Support: The Whitaker Foundation and ARO.  ...  Symposium Support: PPG Industries Foundation.  ...  Ratsch, UCLA); and (fully) continuum approaches describing evolution by stochastic PDEs (M. Siegert, Simon Fraser Univ.). Step-wandering and bunching instabilities for growth on vicinal surfaces (A.  ... 
doi:10.1557/mrs2002.77 fatcat:rbqtnqjxtrdkto2wx5yjzpz6gi

Sharp Analysis for Nonconvex SGD Escaping from Saddle Points [article]

Cong Fang, Zhouchen Lin, Tong Zhang
2019 arXiv   pre-print
Our novel analysis gives new insights into nonconvex SGD and can be potentially generalized to a broad class of stochastic optimization algorithms.  ...  In this paper, we give a sharp analysis for Stochastic Gradient Descent (SGD) and prove that SGD is able to efficiently escape from saddle points and find an (ϵ, O(ϵ^0.5))-approximate second-order stationary  ...  The authors also would like to thank Haishan Ye for very helpful discussions and Huan Li, Zebang Shen, and Li Shen for very helpful comments.  ... 
arXiv:1902.00247v2 fatcat:q2olwny57revbl5z7vytcn5gfq

SCAFFOLD: Stochastic Controlled Averaging for Federated Learning [article]

Sai Praneeth Karimireddy, Satyen Kale, Mehryar Mohri, Sashank J. Reddi, Sebastian U. Stich, Ananda Theertha Suresh
2021 arXiv   pre-print
Federated Averaging (FedAvg) has emerged as the algorithm of choice for federated learning due to its simplicity and low communication cost.  ...  We obtain tight convergence rates for FedAvg and prove that it suffers from 'client-drift' when the data is heterogeneous (non-iid), resulting in unstable and slow convergence.  ...  We thank Filip Hanzely and Jakub Konečnỳ for discussions regarding variance reduction techniques and Blake Woodworth, Virginia Smith and Kumar Kshitij Patel for suggestions which improved the writing.  ... 
arXiv:1910.06378v4 fatcat:fueqnbenv5fylhqoarhiusi2km

Forecasting Travel on Congested Urban Transportation Networks: Review and Prospects for Network Equilibrium Models

David Boyce
2007 Networks and Spatial Economics  
The review presented in this paper focuses on this model formulation and its relation to the sequential procedure of travel forecasting practice.  ...  The authors were clearly eager to contribute entirely new ideas from mathematical economics, optimization and probability theory to a field based on empirical relationships of traffic flow, speed and density  ...  I am pleased to thank Huw Williams and Anna Nagurney for contributions and comments related to this paper.  ... 
doi:10.1007/s11067-006-9009-0 fatcat:xpbrar7gtvf3zcydkroqq6jwia

Page 17 of Mathematical Reviews Vol. 27, Issue Index [page]

Mathematical Reviews  
theory. 95c:00014 Discrete Algorithms * Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 95m:00023 KdV "95 *& KdV "95. 95k:00023 Mathematics and its Applications * Proceedings of the Fifth  ...  Symposium of Mathematics and its Applications.  ... 
« Previous Showing results 1 — 15 out of 86 results