Bo Lin 0004

dblp:97/339-4 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2024
0000-0002-4225-9171ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Artificial intelligence
1 paper
Image recognition and object detection · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Smart cities and intelligent transportation · 100%

Topics — the 2 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
inverse optimization
0.812024
Conformal Inverse Optimization · NeurIPS 2024
Mathematical optimization › optimization under uncertainty
robust optimization
0.812024
Conformal Inverse Optimization · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

spatial post-processing · 1.5contrastive learning · 1.5robust optimization · 0.8conformal prediction · 0.8
YearPublicationVenuePosition
2024 AutoLTS: Automating Cycling Stress Assessment via Contrastive Learning and Spatial Post-processing
abstract
Cycling stress assessment, which quantifies cyclists' perceived stress imposed by the built environment and motor traffics, increasingly informs cycling infrastructure planning and cycling route recommendation. However, currently calculating cycling stress is slow and data-intensive, which hinders its broader application. In this paper, We propose a deep learning framework to support accurate, fast, and large-scale cycling stress assessments for urban road networks based on street-view images. Our framework features i) a contrastive learning approach that leverages the ordinal relationship among cycling stress labels, and ii) a post-processing technique that enforces spatial smoothness into our predictions. On a dataset of 39,153 road segments collected in Toronto, Canada, our results demonstrate the effectiveness of our deep learning framework and the value of using image data for cycling stress assessment in the absence of high-quality road geometry and motor traffic data.
Bo Lin 0004, Shoshanna Saxe, Timothy C. Y. Chan
AAAI1
2024 Conformal Inverse Optimization
abstract
Inverse optimization has been increasingly used to estimate unknown parameters in an optimization model based on decision data. We show that such a point estimation is insufficient in a prescriptive setting where the estimated parameters are used to prescribe new decisions. The prescribed decisions may be low-quality and misaligned with human intuition and thus are unlikely to be adopted. To tackle this challenge, we propose conformal inverse optimization, which seeks to learn an uncertainty set for the unknown parameters and then solve a robust optimization model to prescribe new decisions. Under mild assumptions, we show that our method enjoys provable guarantees on solution quality, as evaluated using both the ground-truth parameters and the decision maker's perception of the unknown parameters. Our method demonstrates strong empirical performance compared to classic inverse optimization.
Bo Lin 0004, Erick Delage, Timothy C. Y. Chan
NeurIPS1
2022 Deep Reinforcement Learning for the Electric Vehicle Routing Problem With Time Windows
abstract
The past decade has seen a rapid penetration of electric vehicles (EVs) as more and more logistics and transportation companies start to deploy electric vehicles (EVs) for service provision. In order to model the operations of a commercial EV fleet, we utilize the EV routing problem with time windows (EVRPTW). In this paper, we propose an end-to-end deep reinforcement learning framework to solve the EVRPTW. In particular, we develop an attention model incorporating the pointer network and a graph embedding layer to parameterize a stochastic policy for solving the EVRPTW. The model is then trained using policy gradient with rollout baseline. Our numerical studies show that the proposed model is able to efficiently solve EVRPTW instances of large sizes that are not solvable with current existing approaches.
Bo Lin 0004, Bissan Ghaddar, Jatin Nathwani
IEEE Trans. Intell. Transp. Syst.1