涓昏浜虹畝浠嬶細闄堝僵鍗庯紝鏁欐巿錛屽浗瀹朵紭縐€闈掑勾鍩洪噾(浼橀潚)鑾峰緱鑰咃紝鍗椾含澶у鐞嗗鍗氬＋錛屾柊鍔犲潯鍥界珛澶у鑱斿悎鍩瑰吇鍗氬＋錛屾浘璧存柊鍔犲潯鍥界珛澶у銆侀娓腑鏂囧ぇ瀛︾瓑瀛︿範涓庤闂€備富鎸?瀹屾垚鐨勫熀閲戝寘鎷浗瀹惰嚜鐒剁瀛﹀熀閲戦潚騫撮」鐩€侀潰涓婇」鐩拰浼樼闈掑勾欏圭洰絳夛紝鍙備笌鍥藉鑷劧縐戝鍩洪噾閲嶇偣欏圭洰錛屼唬琛ㄤ綔鍙戣〃鍦ㄣ€奙athematical Programming銆嬶紝銆奡IAM Journal on Optimization銆嬪強CVPR銆丯IPS絳夊浗闄呯煡鍚嶅鏈湡鍒婁笌浼氳, 澶氱瘒璁烘枃鍏ラ€塃SI楂樿寮曡鏂囥€傝幏鍗庝漢鏁板瀹惰仈鐩熸渶浣寵鏂囧錛?017銆?018榪炵畫涓ゅ勾錛夛紝涓浗榪愮瀛︿細闈掑勾縐戞妧濂栵紙2018錛夛紝鍗椾含澶у闈掑勾浜斿洓濂栫珷(2019)錛屽叆閫夐鎵瑰崡浜ぇ瀛︿徊鑻遍潚騫村鑰咃紙鍏ㄦ牎10浜猴紝2018錛夊強姹熻嫃鐪佺ぞ縐戜紭闈掞紙2019錛夈€?/p>
鎶ュ憡鍐呭姒傝錛歐e live in the age of big data. The 5 characteristics of big data - volume, value, variety, velocity and veracity - have a significant impact on optimization. In this talk, we discuss some thinking of algorithmic design for big data related optimization problems. Specifically, we consider splitting methods for large scale structure optimization, to analyze the data with high volume and low value density. We also design efficient algorithms for distribution robust optimization, to cope with brittle veracity in data analysis. Finally, we propose LP-based approach for Markov Decision Process, which lays a deep ground in sequential decision making with dynamic data generated at a high velocity.
鍗椾含澶у闄堝僵鍗庢暀鎺堝鏈姤鍛?docx
