Arrow Research search

Author name cluster

Bing Lu

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

NeurIPS Conference 2025 Conference Paper

GreenHyperSpectra: A multi-source hyperspectral dataset for global vegetation trait prediction

  • Eya Cherif
  • Arthur Ouaknine
  • Luke Brown
  • Phuong Dao
  • Kyle Kovach
  • Bing Lu
  • Daniel Mederer
  • Hannes Feilhauer

Plant traits such as leaf carbon content and leaf mass are essential variables in the study of biodiversity and climate change. However, conventional field sampling cannot feasibly cover trait variation at ecologically meaningful spatial scales. Machine learning represents a valuable solution for plant trait prediction across ecosystems, leveraging hyperspectral data from remote sensing. Nevertheless, trait prediction from hyperspectral data is challenged by label scarcity and substantial domain shifts (\eg across sensors, ecological distributions), requiring robust cross-domain methods. Here, we present GreenHyperSpectra, a pretraining dataset encompassing real-world cross-sensor and cross-ecosystem samples designed to benchmark trait prediction with semi- and self-supervised methods. We adopt an evaluation framework encompassing in-distribution and out-of-distribution scenarios. We successfully leverage GreenHyperSpectra to pretrain label-efficient multi-output regression models that outperform the state-of-the-art supervised baseline. Our empirical analyses demonstrate substantial improvements in learning spectral representations for trait prediction, establishing a comprehensive methodological framework to catalyze research at the intersection of representation learning and plant functional traits assessment. We also share the dataset\footnotemark[1], code and pretrained model objects for this study \href{https: //github. com/echerif18/HyspectraSSL}{here}. \footnotetext[1]{GreenHyperSpectra dataset: \href{https: //huggingface. co/datasets/Avatarr05/GreenHyperSpectra}{https: //huggingface. co/datasets/Avatarr05/GreenHyperSpectra}}

TCS Journal 2001 Journal Article

Wire segmenting for buffer insertion based on RSTP-MSP

  • Bing Lu
  • Jun Gu
  • Xiaodong Hu
  • Eugene Shragowitz

This paper presents an approximation algorithm for simultaneously constructing a rectilinear Steiner tree and buffer insertion points into the tree. The objective of the algorithm is to divide each wire into multiple smaller segments and minimize the number of the buffer insertion points (Steiner points) which are only located at the end of each segment. We show that (a) the Steiner ratio is 1 3, that is, the rectilinear minimum spanning tree yields a polynomial-time approximation with a performance ratio exactly 3; (b) there exists a polynomial-time approximation with a performance ratio 2.

v2026.09.13