arXiv subjects

Shufan Zhang

Publications and source records attributed to Shufan Zhang.

12 recordsLinked to original sources

arXiv2026

RobotEQ: Towards Social Proactive Intelligence in Embodied Agents

Embodied agents represent a prominent research focus across both academia and industry. The prevailing paradigm has gradually shifted from reactive assistance, which requires explicit user queries, to proactive assistance, capable of recognizing human needs and offering support without explicit instructions. Nevertheless, existing studies on proactive assistance remain confined to narrow scenarios and primarily emphasize task completeness, whereas real-world agents must operate in open-domain environments while adhering to social expectations. To bridge this gap, we extend the concept of proactive assistance to Social Proactive Intelligence (SPI), characterized by diverse scenarios, social understanding, and robot-centric behaviors. We further introduce RobotEQ, a dedicated benchmark for SPI. We first define two tasks: behavior judgment, emphasizing global contextual understanding, and spatial grounding, focusing on local perceptual details. Building on these tasks, we construct RobotEQ-Data, a dataset comprising 1,812 synthetic and 223 real-world scenarios, 7 social facets, 22K+ human annotations, 3K+ behavior judgment questions, and 3K+ spatial grounding questions. Furthermore, we establish RobotEQ-Bench to evaluate the performance of representative models. Experimental results demonstrate that current models fall short of achieving reliable SPI. Further analysis reveals that incorporating external social knowledge yields consistent improvements. This work aims to advance the development of socially desirable embodied agents in open-domain environments.

cs.RO↗

arXiv2026

ReBound: Reuse-Aware Privacy For Interactive Decision Support

Differentially private decision support frameworks answer complex aggregate threshold queries with formal bounds on false negative and false positive rates, but treat each query independently with no memory of past results. In practice, analysts work interactively, issuing sequences of related queries that refine bounds, adjust thresholds, or derive new functions from previous ones. We propose ReBound, a framework that reuses cached results from previous queries to answer new queries at reduced or zero additional privacy cost while maintaining formal utility guarantees. ReBound introduces a reuse framework for multiple refinement types, a cache graph structure for efficient lookup of reusable results, and a negotiation mechanism for when requested bounds cannot be met within budget.

cs.CR↗

arXiv2026

VTI-CoT: Visual-Textual Interleaved Chain of Thought for Video Reasoning

Video reasoning aims to understand complex temporal events and causal relationships within videos. Recently, Chain-of-Thought (CoT) has been introduced to this field to enhance reasoning accuracy. However, existing CoT-based video reasoning methods primarily rely on text-only information for logical deduction, overlooking critical visual information during the inference process. Inspired by the human cognitive mechanism of reviewing visual segments during inference, we propose VTI-CoT, a Visual-Textual Interleaved CoT framework. VTI-CoT integrates textual reasoning steps with corresponding visual frames. Given the scarcity of visual-textual interleaved CoT in existing datasets, we develop an automated annotation pipeline to construct high-quality multimodal CoT data. Further, reasoning over long-form videos entails increasingly long CoT token sequences, which severely hinders training convergence and efficiency. To address this, we employ Optical Character Recognition (OCR)-based compression techniques to compress CoT supervision signals into a single canvas. Experimental results demonstrate that VTI-CoT achieves state-of-the-art performance among models of the same parameter scale while significantly improving training efficiency.

cs.CV↗

arXiv2026

Interpreting the Error of Differentially Private Median Queries through Randomization Intervals

It can be difficult for practitioners to interpret the quality of differentially private (DP) statistics due to the added noise. One method to help analysts understand the amount of error introduced by DP is to return a Randomization Interval (RI), along with the statistic. A RI is a type of confidence interval that bounds the error introduced by DP. For queries where the noise distribution depends on the input, such as the median, prior work degrades the quality of the median itself to obtain a high-quality RI. In this work, we propose PostRI, a solution to compute a RI after the median has been estimated. PostRI enables a median estimation with 14%-850% higher utility than related work, while maintaining a narrow RI.

cs.CR↗

arXiv2025

Planning future charging infrastructure for private EVs: A city-scale assessment of demand and capacity

This study proposes the first demand-driven, multi-objective planning model for optimizing city-scale capacity allocation of EV charging infrastructure. The model employs a bottom-up approach to estimate charging demand differentiated by vehicle type-battery electric vehicles (BEVs), extended-range electric vehicles (EREVs), and plug-in hybrid electric vehicles (PHEVs). Chongqing, a rapidly expanding EV industry cluster in China with a strong industrial base, supportive policies, and diverse urban morphologies, is selected as the case study. The results show that (1) monthly EV electricity consumption in Chongqing rose from 18.9 gigawatt-hours (GWh) in June 2022 to 57.5 GWh in December 2024, with associated carbon emissions increasing from 9.9 kilotons of carbon dioxide (ktCO2) to 30 ktCO2; (2) 181,622 additional charging piles were installed between 2022 and 2024, with the fastest growth observed in Yubei, reflecting a demand-responsive strategy that prioritizes areas with higher population density, higher income levels, and adequate land availability for pile deployment, rather than broad geographic coverage; and (3) between 2025 and 2030, EV electricity demand is projected to reach 1940 GWh, with the number of charging piles exceeding 1.4 million, and charging demand from EREVs and PHEVs expected to overtake BEVs later in the period. While Chongqing serves as the pilot area, the proposed planning platform is adaptable for application in cities worldwide, enabling cross-regional comparisons under diverse socio-economic, geographic, and policy conditions. Overall, this work offers policymakers a versatile tool to support sustainable, cost-effective EV infrastructure deployment aligned with low-carbon electrification targets in the transportation sector.

physics.soc-ph↗

arXiv2025

Building floorspace and stock measurement: A review of global efforts, knowledge gaps, and research priorities

Despite a substantial body of research-evidenced by our analysis of 2,628 peer-reviewed papers-global building floorspace data remain fragmented, inconsistent, and methodologically diverse. The lack of high-quality and openly accessible datasets poses major challenges to accurately assessing building carbon neutrality. This review focuses on global building floorspace, especially its nexus with energy and emissions. The key research areas include energy modeling, emissions analysis, building retrofits, and life cycle assessments. Each measurement approach-top-down, bottom-up, and hybrid-has its own limitations: top-down methods provide broad estimates but low accuracy, whereas bottom-up approaches are more precise but data intensive. Our simulations reveal a surge in floorspace growth across emerging economies-most notably in India, Indonesia, and Africa-with India's per capita floorspace projected to triple by 2070. We emphasize the need for a high-resolution global floorspace imagery database to compare energy efficiency, track decarbonization progress, and assess renovation impacts while promoting building sufficiency and accelerating the transition to net-zero building systems.

physics.soc-ph↗

arXiv2024

Estimation of Global Building Stocks by 2070: Unlocking Renovation Potential

Buildings produce one-third of carbon emissions globally, however, data absence regarding global floorspace poses challenges in advancing building carbon neutrality. We compile the measured building stocks for 14 major economies and apply our global building stock model, GLOBUS, to evaluate future trends in stock turnover. Based on a scenario not considering renovation, by 2070 the building stock in developed economies will be ~1.4 times that of 2020 (100 billion m2); in developing economies it is expected to be 2.2 times that of 2020 (313 billion m2). Based on a techno-economic potential scenario, however, stocks in developed economies will decline to approximately 0.8 times the 2020 level, while stocks in developing economies will increase to nearly twice the 2020 level due to their fewer buildings currently. Overall, GLOBUS provides a way of calculating the global building stock, helping scientists, engineers, and policymakers conduct a range of investigation across various future scenarios.

econ.GN↗

arXiv2024

GLOBUS: Global building renovation potential by 2070

Surpassing the two large emission sectors of transportation and industry, the building sector accounted for 34% and 37% of global energy consumption and carbon emissions in 2021, respectively. The building sector, the final piece to be addressed in the transition to net-zero carbon emissions, requires a comprehensive, multisectoral strategy for reducing emissions. Until now, the absence of data on global building floorspace has impeded the measurement of building carbon intensity (carbon emissions per floorspace) and the identification of ways to achieve carbon neutrality for buildings. For this study, we develop a global building stock model (GLOBUS) to fill that data gap. Our study's primary contribution lies in providing a dataset of global building stock turnover using scenarios that incorporate various levels of building renovation. By unifying the evaluation indicators, the dataset empowers building science researchers to perform comparative analyses based on floorspace. Specifically, the building stock dataset establishes a reference for measuring carbon emission intensity and decarbonization intensity of buildings within different countries. Further, we emphasize the sufficiency of existing buildings by incorporating building renovation into the model. Renovation can minimize the need to expand the building stock, thereby bolstering decarbonization of the building sector.

econ.EM↗

arXiv2023

Preventing Inferences through Data Dependencies on Sensitive Data

Simply restricting the computation to non-sensitive part of the data may lead to inferences on sensitive data through data dependencies. Inference control from data dependencies has been studied in the prior work. However, existing solutions either detect and deny queries which may lead to leakage -- resulting in poor utility, or only protects against exact reconstruction of the sensitive data -- resulting in poor security. In this paper, we present a novel security model called full deniability. Under this stronger security model, any information inferred about sensitive data from non-sensitive data is considered as a leakage. We describe algorithms for efficiently implementing full deniability on a given database instance with a set of data dependencies and sensitive cells. Using experiments on two different datasets, we demonstrate that our approach protects against realistic adversaries while hiding only minimal number of additional non-sensitive cells and scales well with database size and sensitive data.

cs.DB↗

arXiv2023

DProvDB: Differentially Private Query Processing with Multi-Analyst Provenance

Recent years have witnessed the adoption of differential privacy (DP) in practical database systems like PINQ, FLEX, and PrivateSQL. Such systems allow data analysts to query sensitive data while providing a rigorous and provable privacy guarantee. However, the existing design of these systems does not distinguish data analysts of different privilege levels or trust levels. This design can have an unfair apportion of the privacy budget among the data analyst if treating them as a single entity, or waste the privacy budget if considering them as non-colluding parties and answering their queries independently. In this paper, we propose DProvDB, a fine-grained privacy provenance framework for the multi-analyst scenario that tracks the privacy loss to each single data analyst. Under this framework, when given a fixed privacy budget, we build algorithms that maximize the number of queries that could be answered accurately and apportion the privacy budget according to the privilege levels of the data analysts.

cs.DB↗

arXiv2023

Recovery from Non-Decomposable Distance Oracles

A line of work has looked at the problem of recovering an input from distance queries. In this setting, there is an unknown sequence $s \in \{0,1\}^{\leq n}$, and one chooses a set of queries $y \in \{0,1\}^{\mathcal{O}(n)}$ and receives $d(s,y)$ for a distance function $d$. The goal is to make as few queries as possible to recover $s$. Although this problem is well-studied for decomposable distances, i.e., distances of the form $d(s,y) = \sum_{i=1}^n f(s_i, y_i)$ for some function $f$, which includes the important cases of Hamming distance, $\ell_p$-norms, and $M$-estimators, to the best of our knowledge this problem has not been studied for non-decomposable distances, for which there are important special cases such as edit distance, dynamic time warping (DTW), Frechet distance, earth mover's distance, and so on. We initiate the study and develop a general framework for such distances. Interestingly, for some distances such as DTW or Frechet, exact recovery of the sequence $s$ is provably impossible, and so we show by allowing the characters in $y$ to be drawn from a slightly larger alphabet this then becomes possible. In a number of cases we obtain optimal or near-optimal query complexity. We also study the role of adaptivity for a number of different distance functions. One motivation for understanding non-adaptivity is that the query sequence can be fixed and the distances of the input to the queries provide a non-linear embedding of the input, which can be used in downstream applications involving, e.g., neural networks for natural language processing.

cs.DS↗

arXiv2019

$Laoco\ddot{o}n$: Scalable and Portable Receipt-free E-voting Protocol without Untappable Channels

Vote-buying and voter-coercion are the impending threats when deploying remote online voting into large scale elections. With a policy of carrot and stick, it will encourage voters to deviate from honest voting strategy and spoil the democratic election. To deal with this problem, many voting protocols proposed their solutions with the notion of receipt-freeness. However, existing receipt-free voting protocols either rely on some impractical assumptions as untappable communication channel, or are burden with heavy voter-side computation and quadratic tallying complexity. In this paper, we present $Laoco\ddot{o}n$, a brand new cryptographic voting protocol which is practical and light-weight to be deployed in large scale online elections. By taking advantage of proxy re-encryption, our protocol can defend vote-buying attacks. Furthermore, we introduce a new property, candidate-adaptiveness, in electronic voting which refers to as every candidate knows the real-time vote number towards himself, while he knows nothing about others, nor he buys votes. We prove the correctness of our protocol and evaluate the performance with experimental results. Finally we advance some open problems which will be coped in our future work.

cs.CR↗