SearcharxivSearch

arXiv subjects

Chan

Publications and source records attributed to Chan.

8 recordsLinked to original sources

MedCache: Efficient and Temporally Valid Memory for Longitudinal Clinical Agents

Longitudinal clinical agents must maintain an evolving patient state from evidence distributed across visits, time points, and specialties. However, how agent memory should be designed for this setting remains unclear. We introduce a benchmark of multi-visit, multi-specialty patient records that evaluates long-context evidence retrieval, cross-time evidence aggregation, and cross-specialty clinical reasoning. Using this benchmark, we systematically study four memory design choices: curation, organization, retrieval, and memory-augmented reasoning. We find that temporal validity is more important than simply retaining more history; specialty-factorized memory reduces context but can hide shared evidence; and multiple agents help when specialists must reason together, not merely when evidence comes from multiple memories. Guided by these findings, we propose \textit{MedCache}, a hybrid framework that constructs temporally valid patient memory, organizes evidence into overlapping specialty views, routes each query to relevant memories, and adaptively invokes one or multiple specialists. Experiments show that MedCache improves reasoning accuracy and memory efficiency over strong single-agent and multi-agent baselines, while generalizing across model backbones and external datasets.

cs.LG

Cross-Sign Language Transfer Learning Using Domain Adaptation with Multi-scale Temporal Alignment

Sign language serves as a vital means of communication for individuals with hearing impairments, yet recognition resources for the over 100 distinct sign languages are severely lacking. In response, we present our work on sign language recognition using transfer learning and the domain adaptation method TA3N, which utilizes the Temporal Relational Network (TRN) module for aligning multi-scale temporal relations. Our findings highlight the superior performance of Domain Adaptation to neural network-based transfer learning, particularly in improving recognition of American Sign Language (ASL). Our research also identifies the effectiveness of aligning shorter-term temporal features between source and target domains. In addition to using RGB, we conducted experiments using Optical Flow mode for the sign language samples, ultimately determining that RGB outperforms Optical Flow in the majority of cases. Our work aims to improve accessibility and communication for individuals who rely on sign language as their primary mode of communication.

cs.AI

A Cloud-Edge System for Multimodal Clinical Screening in Resource-Constrained Rural Settings

Medical AI has demonstrated specialist-level diagnostic accuracy, yet these capabilities remain largely inaccessible in resource-constrained rural settings where bandwidth is scarce, compute is limited, and clinical decision-making requires integrating heterogeneous modalities. We introduce a cloud--edge collaborative architecture that addresses these constraints: lightweight, domain-specific models on the edge transform raw medical data into compact structured outputs, while a cloud LLM synthesizes these outputs into clinical summaries. An LLM-based orchestrator dynamically selects diagnostic tools based on patient context, promoting comprehensive modality coverage without processing irrelevant inputs. We evaluate on 20 multimodal clinical cases spanning cardiac, obstetric, trauma, and screening scenarios under three simulated network profiles (500,kbps--5,Mbps). The hybrid system achieves 98--99% diagnostic tool recall with 92--96% precision, matches or exceeds cloud-only baselines on clinical accuracy, and maintains bandwidth-invariant latency (25--35,s) at 4--15x lower token cost. These results highlight the role of architectural design in enabling efficient multimodal integration and improving factual grounding compared to cloud-only approaches under deployment constraints.

cs.LG

Information Subtraction: Learning Representations for Conditional Entropy

The representations of conditional entropy and conditional mutual information are significant in explaining the unique effects among variables. While previous studies based on conditional contrastive sampling have effectively removed information regarding discrete sensitive variables, they have not yet extended their scope to continuous cases. This paper introduces Information Subtraction, a framework designed to generate representations that preserve desired information while eliminating the undesired. We implement a generative-based architecture that outputs these representations by simultaneously maximizing an information term and minimizing another. With its flexibility in disentangling information, we can iteratively apply Information Subtraction to represent arbitrary information components between continuous variables, thereby explaining the various relationships that exist between them. Our results highlight the representations' ability to provide semantic features of conditional entropy. By subtracting sensitive and domain-specific information, our framework demonstrates effective performance in fair learning and domain generalization. The code for this paper is available at https://github.com/jh-liang/Information-Subtraction

cs.LG

Public Access Defibrillator Deployment for Cardiac Arrests: A Learn-Then-Optimize Approach with SHAP-based Interpretable Analytics

Out-of-hospital cardiac arrest (OHCA) survival rates remain extremely low due to challenges in the timely accessibility of medical devices. Therefore, effective deployment of automated external defibrillators (AED) can significantly increase survival rates. Precise and interpretable predictions of OHCA occurrences provide a solid foundation for efficient and robust AED deployment optimization. This study develops a novel learn-then-optimize approach, integrating three key components: a machine learning prediction model, SHAP-based interpretable analytics, and a SHAP-guided integer programming (SIP) model. The machine learning model is trained utilizing only geographic data as inputs to overcome data availability obstacles, and its strong predictive performance validates the feasibility of interpretation. Furthermore, the SHAP model elaborates on the contribution of each geographic feature to the OHCA occurrences. Finally, an integer programming model is formulated for optimizing AED deployment, incorporating SHAP-weighted OHCA densities. Various numerical experiments are conducted across different settings. Based on comparative and sensitive analysis, the optimization effect of our approach is verified and valuable insights are derived to provide substantial support for theoretical extension and practical implementation.

math.OC

On the Opportunities of Green Computing: A Survey

Artificial Intelligence (AI) has achieved significant advancements in technology and research with the development over several decades, and is widely used in many areas including computing vision, natural language processing, time-series analysis, speech synthesis, etc. During the age of deep learning, especially with the arise of Large Language Models, a large majority of researchers' attention is paid on pursuing new state-of-the-art (SOTA) results, resulting in ever increasing of model size and computational complexity. The needs for high computing power brings higher carbon emission and undermines research fairness by preventing small or medium-sized research institutions and companies with limited funding in participating in research. To tackle the challenges of computing resources and environmental impact of AI, Green Computing has become a hot research topic. In this survey, we give a systematic overview of the technologies used in Green Computing. We propose the framework of Green Computing and devide it into four key components: (1) Measures of Greenness, (2) Energy-Efficient AI, (3) Energy-Efficient Computing Systems and (4) AI Use Cases for Sustainability. For each components, we discuss the research progress made and the commonly used techniques to optimize the AI efficiency. We conclude that this new research direction has the potential to address the conflicts between resource constraints and AI development. We encourage more researchers to put attention on this direction and make AI more environmental friendly.

cs.AI

A Deep Learning Framework for Traffic Data Imputation Considering Spatiotemporal Dependencies

Spatiotemporal (ST) data collected by sensors can be represented as multi-variate time series, which is a sequence of data points listed in an order of time. Despite the vast amount of useful information, the ST data usually suffer from the issue of missing or incomplete data, which also limits its applications. Imputation is one viable solution and is often used to prepossess the data for further applications. However, in practice, n practice, spatiotemporal data imputation is quite difficult due to the complexity of spatiotemporal dependencies with dynamic changes in the traffic network and is a crucial prepossessing task for further applications. Existing approaches mostly only capture the temporal dependencies in time series or static spatial dependencies. They fail to directly model the spatiotemporal dependencies, and the representation ability of the models is relatively limited.

cs.LG

An SFP--FCC Method for Pricing and Hedging Early-exercise Options under L\'evy Processes

This paper extends the Singular Fourier--Pad\'e (SFP) method proposed by Chan (2018) to pricing/hedging early-exercise options--Bermudan, American and discrete-monitored barrier options--under a L\'evy process. The current SFP method is incorporated with the Filon--Clenshaw--Curtis (FCC) rules invented by Dom\'inguez et al. (2011), and we call the new method SFP--FCC. The main purpose of using the SFP--FCC method is to require a small number of terms to yield fast error convergence and to formulate option pricing and option Greek curves rather than individual prices/Greek values. We also numerically show that the SFP--FCC method can retain a global spectral convergence rate in option pricing and hedging when the risk-free probability density function is piecewise smooth. Moreover, the computational complexity of the method is $\mathcal{O}((L-1)(N+1)(\tilde{N} \log \tilde{N}) )$ with $N$ a (small) number of complex Fourier series terms, $\tilde{N}$ a number of Chebyshev series terms and $L$, the number of early-exercise/monitoring dates. Finally, we show that our method is more favourable than existing techniques in numerical experiments.

q-fin.CP