Search

We measure the time-integrated CP asymmetry in $D^{0} \rightarrow K^{0}_{S}K^{0}_{S}$ decays reconstructed in $e^{+}e^{-} \rightarrow c\overline{c}$ events collected by the Belle and Belle II experiments. The corresponding data samples have integrated luminosities of 980 fb$^{-1}$ and 428 fb$^{-1}$, respectively. The $D^{0}$ decays are required to originate from the $D^{*+} \rightarrow D^{0}\pi^{+}$ decay, which determines the charm flavor at production time. A control sample of $D^{0} \rightarrow K^{+}K^{-}$ decays is used to correct for production and detection asymmetries. The result, $(-1.4\pm1.3{\rm(stat)}\pm0.1{\rm (syst)})\%$, is consistent with previous determinations and with CP symmetry., Comment: 10 pages, 3 figures. arXiv admin note: text overlap with arXiv:2410.22961

We perform a model-independent measurement of the $D^0$-$\overline{D}{}^0$ mixing parameters using samples of $e^+e^-$-collision data collected by the Belle and Belle II experiments that have integrated luminosities of $951\ \text{fb}^{-1}$ and $408\ \text{fb}^{-1}$, respectively. Approximately $2.05\times10^6$ neutral $D$ mesons are reconstructed in the $D^0\rightarrow K^0_{S}\pi^+\pi^-$ channel, with the neutral $D$ flavor tagged by the charge of the pion in the $D^{*+}\rightarrow D^0\pi^+$ decay. Assuming charge-parity symmetry, the mixing parameters are measured to be $ x = (4.0\pm1.7\pm0.4)\times 10^{-3} $ and $ y = (2.9\pm1.4\pm0.3)\times 10^{-3}$, where the first uncertainties are statistical and the second systematic. The results are consistent with previous determinations.

We propose a simple yet effective neural network-based framework for global illumination rendering. Recently, rendering techniques that learn neural radiance caches by minimizing the difference (i.e., residual) between the left and right sides of the rendering equation have been suggested. Due to their ease of implementation and the advantage of excluding path integral calculations, these techniques have been applied to various fields, such as free-viewpoint rendering, differentiable rendering, and real-time rendering. However, issues of slow training and occasionally darkened renders have been noted. We identify the cause of these issues as the bias and high variance present in the gradient estimates of the existing residual-based objective function. To address this, we introduce a new objective function that maintains the same global optimum as before but allows for unbiased and low-variance gradient estimates, enabling faster and more accurate training of neural networks. In conclusion, this method is simply implemented by ignoring the partial derivatives of the right-hand side, and theoretical and experimental analyses demonstrate the effectiveness of the proposed loss.

Aspect-based sentiment analysis (ABSA) is the challenging task of extracting sentiment along with its corresponding aspects and opinions from human language. Due to the inherent variability of natural language, aspect and opinion terms can be expressed in various surface forms, making their accurate identification complex. Current evaluation methods for this task often restrict answers to a single ground truth, penalizing semantically equivalent predictions that differ in surface form. To address this limitation, we propose a novel, fully automated pipeline that augments existing test sets with alternative valid responses for aspect and opinion terms. This approach enables a fairer assessment of language models by accommodating linguistic diversity, resulting in higher human agreement than single-answer test sets (up to 10%p improvement in Kendall's Tau score). Our experimental results demonstrate that Large Language Models (LLMs) show substantial performance improvements over T5 models when evaluated using our augmented test set, suggesting that LLMs' capabilities in ABSA tasks may have been underestimated. This work contributes to a more comprehensive evaluation framework for ABSA, potentially leading to more accurate assessments of model performance in information extraction tasks, particularly those involving span extraction., Comment: Preprint

We present a measurement of the branching fraction and time-dependent charge-parity ($CP$) decay-rate asymmetries in $B^0 \to J/\psi \pi^0$ decays. The data sample was collected with the Belle~II detector at the SuperKEKB asymmetric $e^+e^-$ collider in 2019-2022 and contains $(387\pm 6)\times 10^6$ $B\overline{B}$ meson pairs from $\Upsilon(4S)$ decays. We reconstruct $392\pm 24$ signal decays and fit the $CP$ parameters from the distribution of the proper-decay-time difference of the two $B$ mesons. We measure the branching fraction to be $B(B^0 \to J/\psi \pi^0)=(2.02 \pm 0.12 \pm 0.10)\times 10^{-5}$ and the direct and mixing-induced $CP$ asymmetries to be $C_{CP}=0.13 \pm 0.12 \pm 0.03$ and $S_{CP}=-0.88 \pm 0.17 \pm 0.03$, respectively, where the first uncertainties are statistical and the second are systematic. We observe mixing-induced $CP$ violation with a significance of $5.0$ standard deviations for the first time in this mode.

Large Language Models (LLMs) excel at understanding the semantic relationships between queries and documents, even with lengthy and complex long-tail queries. These queries are challenging for feedback-based rankings due to sparse user engagement and limited feedback, making LLMs' ranking ability highly valuable. However, the large size and slow inference of LLMs necessitate the development of smaller, more efficient models (sLLMs). Recently, integrating ranking label generation into distillation techniques has become crucial, but existing methods underutilize LLMs' capabilities and are cumbersome. Our research, RRADistill: Re-Ranking Ability Distillation, propose an efficient label generation pipeline and novel sLLM training methods for both encoder and decoder models. We introduce an encoder-based method using a Term Control Layer to capture term matching signals and a decoder-based model with a ranking layer for enhanced understanding. A/B testing on a Korean-based search platform, validates the effectiveness of our approach in improving re-ranking for long-tail queries., Comment: Accepted to EMNLP 2024 Industry Track. First two authors contributed equally

We perform the first search for $C\!P$ violation in ${D_{(s)}^{+}\to{}K_{S}^{0}K^{-}\pi^{+}\pi^{+}}$ decays. We use a combined data set from the Belle and Belle II experiments, which study $e^+e^-$ collisions at center-of-mass energies at or near the $\Upsilon(4S)$ resonance. We use 980 fb$^{-1}$ of data from Belle and 428 fb$^{-1}$ of data from Belle~II. We measure six $C\!P$-violating asymmetries that are based on triple products and quadruple products of the momenta of final-state particles, and also the particles' helicity angles. We obtain a precision at the level of 0.5% for $D^+\to{}K_{S}^{0}K^{-}\pi^{+}\pi^{+}$ decays, and better than 0.3% for $D^+_{s}\to{}K_{S}^{0}K^{-}\pi^{+}\pi^{+}$ decays. No evidence of $C\!P$ violation is found. Our results for the triple-product asymmetries are the most precise to date for singly-Cabibbo-suppressed $D^+$ decays. Our results for the other asymmetries are the first such measurements performed for charm decays., Comment: 21 pages, 10 figures

Language model performance depends on identifying the optimal mixture of data groups to train on (e.g., law, code, math). Prior work has proposed a diverse set of methods to efficiently learn mixture proportions, ranging from fitting regression models over training runs to dynamically updating proportions throughout training. Surprisingly, we find that no existing method consistently outperforms a simple stratified sampling baseline in terms of average test perplexity per group. In this paper, we study the cause of this inconsistency by unifying existing methods into a standard optimization framework. We show that all methods set proportions to minimize total loss, subject to a method-specific mixing law -- an assumption on how loss is a function of mixture proportions. We find that existing parameterizations of mixing laws can express the true loss-proportion relationship empirically, but the methods themselves often set the mixing law parameters inaccurately, resulting in poor and inconsistent performance. Finally, we leverage the insights from our framework to derive a new online method named Aioli, which directly estimates the mixing law parameters throughout training and uses them to dynamically adjust proportions. Empirically, Aioli outperforms stratified sampling on 6 out of 6 datasets by an average of 0.28 test perplexity points, whereas existing methods fail to consistently beat stratified sampling, doing up to 6.9 points worse. Moreover, in a practical setting where proportions are learned on shorter runs due to computational constraints, Aioli can dynamically adjust these proportions over the full training run, consistently improving performance over existing methods by up to 12.01 test perplexity points.

Type Ia supernovae (SNe Ia) serve as the most crucial standardizable candles in cosmology, providing direct measurements of the universe's expansion history. However, it is well-known that the post-standardization brightness of SNe Ia is influenced by the properties of their host galaxies, such as mass and star formation rate, both of which are closely related to progenitor age. In this study, we reaffirm the ubiquitous and robust correlation between SN Ia luminosity and host age, showing that this host property dependence arises primarily from stellar population age of the host galaxy. This analysis was conducted using an expanded sample of over 300 hosts across a broad redshift range up to $z \sim 0.4$, ensuring sufficient statistical significance of the result. To quantify the relationship between host age and Hubble residual (HR), we employed two linear regression techniques: LINMIX, which assumes a Gaussian error, and Bayesian hierarchical linear regression, which utilizes a full posterior for the age error. Both models demonstrate a robust correlation between host age and HR, with high statistical significance approaching $5.5 \sigma$. While our new regression analyses yield the slopes that are similar or slightly shallower compared to our previous results, the significance of these slopes has notably increased. These findings robustly validate our previous suggestions that post-standardization SN Ia luminosity varies with progenitor age, which is currently not properly accounted for in SN cosmology., Comment: 13 pages, 10 figures, 2 tables. Submitted to ApJ

The attention to table understanding using recent natural language models has been growing. However, most related works tend to focus on learning the structure of the table directly. Just as humans improve their understanding of sentences by comparing them, they can also enhance their understanding by comparing tables. With this idea, in this paper, we introduce ACCIO, tAble understanding enhanCed via Contrastive learnIng with aggregatiOns, a novel approach to enhancing table understanding by contrasting original tables with their pivot summaries through contrastive learning. ACCIO trains an encoder to bring these table pairs closer together. Through validation via column type annotation, ACCIO achieves competitive performance with a macro F1 score of 91.1 compared to state-of-the-art methods. This work represents the first attempt to utilize pairs of tables for table embedding, promising significant advancements in table comprehension. Our code is available at https://github.com/whnhch/ACCIO/.

With the introduction of transformer-based models for vision and language tasks, such as LLaVA and Chameleon, there has been renewed interest in the discrete tokenized representation of images. These models often treat image patches as discrete tokens, analogous to words in natural language, learning joint alignments between visual and human languages. However, little is known about the statistical behavior of these visual languages - whether they follow similar frequency distributions, grammatical structures, or topologies as natural languages. In this paper, we take a natural-language-centric approach to analyzing discrete visual languages and uncover striking similarities and fundamental differences. We demonstrate that, although visual languages adhere to Zipfian distributions, higher token innovation drives greater entropy and lower compression, with tokens predominantly representing object parts, indicating intermediate granularity. We also show that visual languages lack cohesive grammatical structures, leading to higher perplexity and weaker hierarchical organization compared to natural languages. Finally, we demonstrate that, while vision models align more closely with natural languages than other models, this alignment remains significantly weaker than the cohesion found within natural languages. Through these experiments, we demonstrate how understanding the statistical properties of discrete visual languages can inform the design of more effective computer vision models.

Document visual question answering (DocVQA) pipelines that answer questions from documents have broad applications. Existing methods focus on handling single-page documents with multi-modal language models (MLMs), or rely on text-based retrieval-augmented generation (RAG) that uses text extraction tools such as optical character recognition (OCR). However, there are difficulties in applying these methods in real-world scenarios: (a) questions often require information across different pages or documents, where MLMs cannot handle many long documents; (b) documents often have important information in visual elements such as figures, but text extraction tools ignore them. We introduce M3DocRAG, a novel multi-modal RAG framework that flexibly accommodates various document contexts (closed-domain and open-domain), question hops (single-hop and multi-hop), and evidence modalities (text, chart, figure, etc.). M3DocRAG finds relevant documents and answers questions using a multi-modal retriever and an MLM, so that it can efficiently handle single or many documents while preserving visual information. Since previous DocVQA datasets ask questions in the context of a specific document, we also present M3DocVQA, a new benchmark for evaluating open-domain DocVQA over 3,000+ PDF documents with 40,000+ pages. In three benchmarks (M3DocVQA/MMLongBench-Doc/MP-DocVQA), empirical results show that M3DocRAG with ColPali and Qwen2-VL 7B achieves superior performance than many strong baselines, including state-of-the-art performance in MP-DocVQA. We provide comprehensive analyses of different indexing, MLMs, and retrieval models. Lastly, we qualitatively show that M3DocRAG can successfully handle various scenarios, such as when relevant information exists across multiple pages and when answer evidence only exists in images., Comment: Project webpage: https://m3docrag.github.io

Historical and linguistic connections within the Sinosphere have led researchers to use Classical Chinese resources for cross-lingual transfer when processing historical documents from Korea and Japan. In this paper, we question the assumption of cross-lingual transferability from Classical Chinese to Hanja and Kanbun, the ancient written languages of Korea and Japan, respectively. Our experiments across machine translation, named entity recognition, and punctuation restoration tasks show minimal impact of Classical Chinese datasets on language model performance for ancient Korean documents written in Hanja, with performance differences within $\pm{}0.0068$ F1-score for sequence labeling tasks and up to $+0.84$ BLEU score for translation. These limitations persist consistently across various model sizes, architectures, and domain-specific datasets. Our analysis reveals that the benefits of Classical Chinese resources diminish rapidly as local language data increases for Hanja, while showing substantial improvements only in extremely low-resource scenarios for both Korean and Japanese historical documents. These mixed results emphasize the need for careful empirical validation rather than assuming benefits from indiscriminate cross-lingual transfer.

We conduct a scoping review of existing approaches for synthetic EHR data generation, and benchmark major methods with proposed open-source software to offer recommendations for practitioners. We search three academic databases for our scoping review. Methods are benchmarked on open-source EHR datasets, MIMIC-III/IV. Seven existing methods covering major categories and two baseline methods are implemented and compared. Evaluation metrics concern data fidelity, downstream utility, privacy protection, and computational cost. 42 studies are identified and classified into five categories. Seven open-source methods covering all categories are selected, trained on MIMIC-III, and evaluated on MIMIC-III or MIMIC-IV for transportability considerations. Among them, GAN-based methods demonstrate competitive performance in fidelity and utility on MIMIC-III; rule-based methods excel in privacy protection. Similar findings are observed on MIMIC-IV, except that GAN-based methods further outperform the baseline methods in preserving fidelity. A Python package, ``SynthEHRella'', is provided to integrate various choices of approaches and evaluation metrics, enabling more streamlined exploration and evaluation of multiple methods. We found that method choice is governed by the relative importance of the evaluation metrics in downstream use cases. We provide a decision tree to guide the choice among the benchmarked methods. Based on the decision tree, GAN-based methods excel when distributional shifts exist between the training and testing populations. Otherwise, CorGAN and MedGAN are most suitable for association modeling and predictive modeling, respectively. Future research should prioritize enhancing fidelity of the synthetic data while controlling privacy exposure, and comprehensive benchmarking of longitudinal or conditional generation methods.

We investigate the interplay between self-duality and spatially modulated symmetry of generalized $N$-state clock models, which include the transverse-field Ising model and ordinary $N$-state clock models as special cases. The spatially modulated symmetry of the model becomes trivial when the model's parameters satisfy a specific number-theoretic relation. We find that the duality is non-invertible when the spatially modulated symmetry remains nontrivial, and show that this non-invertibility is resolved by introducing a generalized $\mathbb{Z}_N$ toric code, which manifests ultraviolet/infrared mixing, as the bulk topological order. In this framework, the boundary duality transformation corresponds to the boundary action of a bulk symmetry transformation, with the endpoint of the bulk symmetry defect realizing the boundary duality defect. Our results illuminate not only a holographic perspective on dualities but also a relationship between spatially modulated symmetry and ultraviolet/infrared mixing in one higher dimension., Comment: 7 pages, 2 figures

Quantum resources like entanglement and magic are essential for characterizing the complexity of quantum states. However, when the number of copies of quantum states and the computational time are limited by numbers polynomial in the system size $n$, accurate estimation of the amount of these resources becomes difficult. This makes it impossible to distinguish between ensembles of states with relatively small resources and one that has nearly maximal resources. Such ensembles with small resources are referred to as "pseudo-quantum" ensembles. Recent studies have introduced an ensemble known as the random subset phase state ensemble, which is pseudo-entangled, pseudo-magical, and pseudorandom. While the current state-of-the-art implementation of this ensemble is conjectured to be realized by a circuit with $O(nt)$ depth, it is still too deep for near-term quantum devices to execute for small $t$. In addition, the strict linear dependence on $t$ has only been established as a lower bound on the circuit depth. In this work, we present significantly improved implementations that only require $\omega(\log n)\cdot O(t[\log t]^2)$ depth circuits, which almost saturates the theoretical lower bound. This is also the fastest known for generating pseudorandom states to the best of our knowledge. We believe that our findings will facilitate the implementation of pseudo-ensembles on near-term devices, allowing executions of tasks that would otherwise require ensembles with maximal quantum resources, by generating pseudo-ensembles at a super-polynomially fewer number of entangling and non-Clifford gates., Comment: 8 pages, 1 figure

In full-duplex millimeter-wave (mmWave) systems, the effects of beam squint and the frequency-selectivity of self-interference exacerbate over wide bandwidths. This complicates the use of beamforming to cancel self-interference when communicating over bandwidths on the order of gigahertz. In this work, we present the first analog beamforming codebooks tailored to wideband full-duplex mmWave systems, designed to both combat beam squint and cancel frequency-selective self-interference. Our proposed design constructs such codebooks by minimizing self-interference across the entire band of interest while constraining the coverage provided by these codebooks across that same band. Simulation results using computational electromagnetics to model self-interference suggest that a full-duplex 60 GHz system with our design enjoys lower self-interference and delivers better coverage across bandwidths as wide as 6 GHz, when compared to similar codebook designs that ignore beam squint and/or frequency-selectivity. This allows our design to sustain higher SINRs and spectral efficiencies across wide bandwidths, unlocking the potentials of wideband full-duplex mmWave systems.

The advancement of the Event Horizon Telescope has enabled the study of relativistic jets in active galactic nuclei down to sub-parsec linear scales even at high redshift. Quasi-simultaneous multifrequency observations provide insights into the physical conditions in compact regions and allow testing accretion theories. Initially we aimed at measuring the magnetic field strength close to the central supermassive black hole in NRAO 530 (1730-130) by studying frequency-dependent opacity of the jet matter, Faraday rotation and the spectral index in the mm-radio bands. NRAO 530 was observed quasi-simultaneously at 15, 22, 43, 86, and 227 GHz at four different very long baseline interferometer (VLBI) networks. By the means of imaging and model-fitting, we aligned the images, taken at different frequencies. We explored opacity along the jet and distribution of the linearly polarized emission in it. Our findings reveal that the jet of NRAO 530 at 86 and 227 GHz is transparent down to its origin, with 70 mJy emission detected at 227 GHz potentially originating from the accretion disk. The magnetic field strength near the black hole, estimated at $5r_\mathrm{g}$, is $3\times10^3-3\times10^4$ G (depending on the central black hole mass). These values represent some of the highest magnetic field strengths reported for active galaxies. We also report the first ever VLBI measurement of the Faraday rotation at 43-227 GHz, which reveals rotation measure values as high as -48000 rad/m2 consistent with higher particle density and stronger magnetic fields at the jet's outset. The complex shape of the jet in NRAO 530 is in line with the expected behavior of a precessing jet, with a period estimated to be around $6\pm4$~years., Comment: 18 pages, accepted to A&A

Emotional text-to-speech (TTS) technology has achieved significant progress in recent years; however, challenges remain owing to the inherent complexity of emotions and limitations of the available emotional speech datasets and models. Previous studies typically relied on limited emotional speech datasets or required extensive manual annotations, restricting their ability to generalize across different speakers and emotional styles. In this paper, we present EmoSphere++, an emotion-controllable zero-shot TTS model that can control emotional style and intensity to resemble natural human speech. We introduce a novel emotion-adaptive spherical vector that models emotional style and intensity without human annotation. Moreover, we propose a multi-level style encoder that can ensure effective generalization for both seen and unseen speakers. We also introduce additional loss functions to enhance the emotion transfer performance for zero-shot scenarios. We employ a conditional flow matching-based decoder to achieve high-quality and expressive emotional TTS in a few sampling steps. Experimental results demonstrate the effectiveness of the proposed framework.

This paper presents a framework for extracting georeferenced vehicle trajectories from high-altitude drone footage, addressing key challenges in urban traffic monitoring and limitations of traditional ground-based systems. We employ state-of-the-art computer vision and deep learning to create an end-to-end pipeline that enhances vehicle detection, tracking, and trajectory stabilization. Conducted in the Songdo International Business District, South Korea, the study used a multi-drone experiment over 20 intersections, capturing approximately 12TB of 4K video data over four days. We developed a novel track stabilization method that uses detected vehicle bounding boxes as exclusion masks during image registration, which, combined with advanced georeferencing techniques, accurately transforms vehicle coordinates into real-world geographical data. Additionally, our framework includes robust vehicle dimension estimation and detailed road segmentation for in-depth traffic analysis. The framework produced two high-quality datasets: the Songdo Traffic dataset, comprising nearly 1 million unique vehicle trajectories, and the Songdo Vision dataset, containing over 5,000 human-annotated frames with about 300,000 vehicle instances in four classes. Comparisons between drone-derived data and high-precision sensor data from an instrumented probe vehicle highlight the accuracy and consistency of our framework's extraction in dense urban settings. By publicly releasing these datasets and the pipeline source code, this work sets new benchmarks for data quality, reproducibility, and scalability in traffic research. Results demonstrate the potential of integrating drone technology with advanced computer vision for precise, cost-effective urban traffic monitoring, providing valuable resources for the research community to develop intelligent transportation systems and improve traffic management strategies.

Many risk-sensitive applications require well-calibrated prediction sets over multiple, potentially correlated target variables, for which the prediction algorithm may report correlated non-conformity scores. In this work, we treat the scores as random vectors and aim to construct the prediction set accounting for their joint correlation structure. Drawing from the rich literature on multivariate quantiles and semiparametric statistics, we propose an algorithm to estimate the $1-\alpha$ quantile of the scores, where $\alpha$ is the user-specified miscoverage rate. In particular, we flexibly estimate the joint cumulative distribution function (CDF) of the scores using nonparametric vine copulas and improve the asymptotic efficiency of the quantile estimate using its influence function. The vine decomposition allows our method to scale well to a large number of targets. We report desired coverage and competitive efficiency on a range of real-world regression problems, including those with missing-at-random labels in the calibration set., Comment: 9 pages (+12 appendix), 11 figures, submitted to AISTATS 2025

We present 850 $\mu$m polarization observations of the IC 348 star-forming region in the Perseus molecular cloud as part of the B-fields In STar-forming Region Observation (BISTRO) survey. We study the magnetic properties of two cores (HH 211 MMS and IC 348 MMS) and a filamentary structure of IC 348. We find that the overall field tends to be more perpendicular than parallel to the filamentary structure of the region. The polarization fraction decreases with intensity, and we estimate the trend by power-law and the mean of the Rice distribution fittings. The power indices for the cores are much smaller than 1, indicative of possible grain growth to micron size in the cores. We also measure the magnetic field strengths of the two cores and the filamentary area separately by applying the Davis-Chandrasekhar-Fermi method and its alternative version for compressed medium. The estimated mass-to-flux ratios are 0.45-2.20 and 0.63-2.76 for HH 211 MMS and IC 348 MMS, respectively, while the ratios for the filament is 0.33-1.50. This result may suggest that the transition from subcritical to supercritical conditions occurs at the core scale ($\sim$ 0.05 pc) in the region. In addition, we study the energy balance of the cores and find that the relative strength of turbulence to the magnetic field tends to be stronger for IC 348 MMS than HH 211 MMS. The result could potentially explain the different configurations inside the two cores: a single protostellar system in HH 211 MMS and multiple protostars in IC 348 MMS., Comment: Accepted for publication in ApJ. 21 pages, 12 figures

Pretrained Large Language Models (LLMs) require post-training methods such as supervised fine-tuning (SFT) on instruction-response pairs to enable instruction following. However, this process can potentially harm existing capabilities learned during pretraining. In this paper, we investigate the loss of context awareness after SFT, defined as the capability to extract and understand information from the user-provided context and respond accordingly. We are the first to identify and show that the loss of context-awareness appears on instruction-finetuned LLMs when the chat template is applied to the input prompts. We identify the performance decline is partially caused by the bias embedded into the chat template to focus less on the user-provided context. Based on these observations, we propose two methods to mitigate the loss of context awareness in instruct models: post-hoc attention steering on user prompts and conditional instruction fine-tuning with a context-dependency indicator. Empirical experiments on 4 context-dependent downstream tasks and 3 pretrained LLMs of different sizes show that our methods effectively mitigates the loss of context awareness without compromising the general ability to follow instructions. Our findings also strongly advocate the necessity to carefully benchmark context awareness after instruction fine-tuning.

Remote photoplethysmography (rPPG) enables non-invasive extraction of blood volume pulse signals through imaging, transforming spatial-temporal data into time series signals. Advances in end-to-end rPPG approaches have focused on this transformation where attention mechanisms are crucial for feature extraction. However, existing methods compute attention disjointly across spatial, temporal, and channel dimensions. Here, we propose the Factorized Self-Attention Module (FSAM), which jointly computes multidimensional attention from voxel embeddings using nonnegative matrix factorization. To demonstrate FSAM's effectiveness, we developed FactorizePhys, an end-to-end 3D-CNN architecture for estimating blood volume pulse signals from raw video frames. Our approach adeptly factorizes voxel embeddings to achieve comprehensive spatial, temporal, and channel attention, enhancing performance of generic signal extraction tasks. Furthermore, we deploy FSAM within an existing 2D-CNN-based rPPG architecture to illustrate its versatility. FSAM and FactorizePhys are thoroughly evaluated against state-of-the-art rPPG methods, each representing different types of architecture and attention mechanism. We perform ablation studies to investigate the architectural decisions and hyperparameters of FSAM. Experiments on four publicly available datasets and intuitive visualization of learned spatial-temporal features substantiate the effectiveness of FSAM and enhanced cross-dataset generalization in estimating rPPG signals, suggesting its broader potential as a multidimensional attention mechanism. The code is accessible at https://github.com/PhysiologicAILab/FactorizePhys., Comment: Accepted at NeurIPS, 2024

Pt-based electrocatalysts are the primary choice for fuel cells due to their superior oxygen reduction reaction (ORR) activity. To enhance ORR performance and durability, extensive studies have investigated transition metal alloying, doping, and shape control to optimize the three key governing factors for ORR: geometry, local chemistry, and strain of their surface and subsurface. However, systematic optimization remains incomplete, as it requires an atomic-scale understanding of these factors and their dynamics over potential cycling, as well as their relationship to ORR activity. Here, we implement neural network-assisted atomic electron tomography to measure the 3D atomic structural dynamics and their effects on the functional degradation of PtNi alloy catalysts. Our results reveal that PtNi catalysts undergo shape changes, surface alloying, and strain relaxation during cycling, which can be effectively mitigated by Ga doping. By combining geometry, local chemistry, and strain analysis, we calculated the changes in ORR activity over thousands of cycles and observed that Ga doping leads to higher initial activity and greater stability. These findings offer a pathway to understanding 3D atomic structural dynamics and their relation to ORR activity during cycling, paving the way for the systematic design of durable, high-efficiency nanocatalysts., Comment: 45 pages, 4 main figures, 15 supplementary figures

Recent advancements in text-to-image diffusion models have enabled the personalization of these models to generate custom images from textual prompts. This paper presents an efficient LoRA-based personalization approach for on-device subject-driven generation, where pre-trained diffusion models are fine-tuned with user-specific data on resource-constrained devices. Our method, termed Hollowed Net, enhances memory efficiency during fine-tuning by modifying the architecture of a diffusion U-Net to temporarily remove a fraction of its deep layers, creating a hollowed structure. This approach directly addresses on-device memory constraints and substantially reduces GPU memory requirements for training, in contrast to previous methods that primarily focus on minimizing training steps and reducing the number of parameters to update. Additionally, the personalized Hollowed Net can be transferred back into the original U-Net, enabling inference without additional memory overhead. Quantitative and qualitative analyses demonstrate that our approach not only reduces training memory to levels as low as those required for inference but also maintains or improves personalization performance compared to existing methods., Comment: NeurIPS 2024

Multiply connected electronic networks threaded by flux tubes have been proposed as a platform for adiabatic quantum transport and topological states. Multi-terminal Josephson junction (MTJJ) has been suggested as a pathway to realize this concept. Yet, the manifestations of topology in MTJJ remain open for experimental study. Here, we investigated the artificial topological band structure of three-terminal graphene Josephson junctions. Employing tunnelling spectroscopy and magnetic flux gates, we captured the tomography of the Andreev bound state (ABS) energy spectrum as a function of two independent phase differences. This ABS spectrum exhibits the topological transition from gapped to gapless states, akin to the band structure of nodal-line semimetals. Our results show the potential of graphene-based MTJJs for engineering band topologies in higher dimensions.

As Large Language Models (LLMs) are increasingly deployed in specialized domains with continuously evolving knowledge, the need for timely and precise knowledge injection has become essential. Fine-tuning with paraphrased data is a common approach to enhance knowledge injection, yet it faces two significant challenges: high computational costs due to repetitive external model usage and limited sample diversity. To this end, we introduce LaPael, a latent-level paraphrasing method that applies input-dependent noise to early LLM layers. This approach enables diverse and semantically consistent augmentations directly within the model. Furthermore, it eliminates the recurring costs of paraphrase generation for each knowledge update. Our extensive experiments on question-answering benchmarks demonstrate that LaPael improves knowledge injection over standard fine-tuning and existing noise-based approaches. Additionally, combining LaPael with data-level paraphrasing further enhances performance., Comment: NeurIPS 2024

Vision Large Language Models (VLLMs) usually take input as a concatenation of image token embeddings and text token embeddings and conduct causal modeling. However, their internal behaviors remain underexplored, raising the question of interaction among two types of tokens. To investigate such multimodal interaction during model inference, in this paper, we measure the contextualization among the hidden state vectors of tokens from different modalities. Our experiments uncover a four-phase inference dynamics of VLLMs against the depth of Transformer-based LMs, including (I) Alignment: In very early layers, contextualization emerges between modalities, suggesting a feature space alignment. (II) Intra-modal Encoding: In early layers, intra-modal contextualization is enhanced while inter-modal interaction is suppressed, suggesting a local encoding within modalities. (III) Inter-modal Encoding: In later layers, contextualization across modalities is enhanced, suggesting a deeper fusion across modalities. (IV) Output Preparation: In very late layers, contextualization is reduced globally, and hidden states are aligned towards the unembedding space., Comment: 6 pages, 5 figures

Determining the 3D orientations of an object in an image, known as single-image pose estimation, is a crucial task in 3D vision applications. Existing methods typically learn 3D rotations parametrized in the spatial domain using Euler angles or quaternions, but these representations often introduce discontinuities and singularities. SO(3)-equivariant networks enable the structured capture of pose patterns with data-efficient learning, but the parametrizations in spatial domain are incompatible with their architecture, particularly spherical CNNs, which operate in the frequency domain to enhance computational efficiency. To overcome these issues, we propose a frequency-domain approach that directly predicts Wigner-D coefficients for 3D rotation regression, aligning with the operations of spherical CNNs. Our SO(3)-equivariant pose harmonics predictor overcomes the limitations of spatial parameterizations, ensuring consistent pose estimation under arbitrary rotations. Trained with a frequency-domain regression loss, our method achieves state-of-the-art results on benchmarks such as ModelNet10-SO(3) and PASCAL3D+, with significant improvements in accuracy, robustness, and data efficiency., Comment: Accepted to NeurIPS 2024, Project webpage at http://cvlab.postech.ac.kr/research/3D_EquiPose

Learning the graph topology of a complex network is challenging due to limited data availability and imprecise data models. A common remedy in existing works is to incorporate priors such as sparsity or modularity which highlight on the structural property of graph topology. We depart from these approaches to develop priors that are directly inspired by complex network dynamics. Focusing on social networks with actions modeled by equilibriums of linear quadratic games, we postulate that the social network topologies are optimized with respect to a social welfare function. Utilizing this prior knowledge, we propose a network games induced regularizer to assist graph learning. We then formulate the graph topology learning problem as a bilevel program. We develop a two-timescale gradient algorithm to tackle the latter. We draw theoretical insights on the optimal graph structure of the bilevel program and show that they agree with the topology in several man-made networks. Empirically, we demonstrate the proposed formulation gives rise to reliable estimate of graph topology.

Warm-starting neural network training by initializing networks with previously learned weights is appealing, as practical neural networks are often deployed under a continuous influx of new data. However, it often leads to loss of plasticity, where the network loses its ability to learn new information, resulting in worse generalization than training from scratch. This occurs even under stationary data distributions, and its underlying mechanism is poorly understood. We develop a framework emulating real-world neural network training and identify noise memorization as the primary cause of plasticity loss when warm-starting on stationary data. Motivated by this, we propose Direction-Aware SHrinking (DASH), a method aiming to mitigate plasticity loss by selectively forgetting memorized noise while preserving learned features. We validate our approach on vision tasks, demonstrating improvements in test accuracy and training efficiency., Comment: Published at NeurIPS 2024

Direct Preference Optimization (DPO) trains a language model using human preference data, bypassing the explicit reward modeling phase of Reinforcement Learning from Human Feedback (RLHF). By iterating over sentence pairs in a preference dataset, DPO enhances generation quality by increasing the likelihood of producing preferred sentences over less favored ones. Preference datasets are typically created by selecting preferred sentences through a voting process involving multiple individuals, as opinions can vary due to the subjective nature of human preferences. While the number of votes offers insight into whether a sentence pair is clearly preferable or controversial, current methods do not fully leverage this information. In this paper, we introduce a technique that leverages user voting data to better align with diverse subjective preferences. We employ the Bayesian Minimum Mean Square Error (Bayesian MMSE) estimator to model the probability that one generation is preferable to another. Using this estimated probability as a target, we develop the Vote-based Preference Optimization (VPO) framework, which incorporates the number of votes on both sides to distinguish between controversial and obvious generation pairs. We show that previous algorithms, such as DPO and Identity Preference Optimization (IPO), can be extended using the proposed framework, termed VDPO and VIPO. Our experiments demonstrate that these proposed algorithms outperform various existing methods, including their base algorithms.

Spatial control methods using additional modules on pretrained diffusion models have gained attention for enabling conditional generation in natural images. These methods guide the generation process with new conditions while leveraging the capabilities of large models. They could be beneficial as training strategies in the context of 3D medical imaging, where training a diffusion model from scratch is challenging due to high computational costs and data scarcity. However, the potential application of spatial control methods with additional modules to 3D medical images has not yet been explored. In this paper, we present a tailored spatial control method for 3D medical images with a novel lightweight module, Volumetric Conditioning Module (VCM). Our VCM employs an asymmetric U-Net architecture to effectively encode complex information from various levels of 3D conditions, providing detailed guidance in image synthesis. To examine the applicability of spatial control methods and the effectiveness of VCM for 3D medical data, we conduct experiments under single- and multimodal conditions scenarios across a wide range of dataset sizes, from extremely small datasets with 10 samples to large datasets with 500 samples. The experimental results show that the VCM is effective for conditional generation and efficient in terms of requiring less training data and computational resources. We further investigate the potential applications for our spatial control method through axial super-resolution for medical images. Our code is available at \url{https://github.com/Ahn-Ssu/VCM}, Comment: 17 pages, 18 figures, accepted @ WACV 2025

Machine learning (ML) for text classification has been widely used in various domains, such as toxicity detection, chatbot consulting, and review analysis. These applications can significantly impact ethics, economics, and human behavior, raising serious concerns about trusting ML decisions. Several studies indicate that traditional metrics, such as model confidence and accuracy, are insufficient to build human trust in ML models. These models often learn spurious correlations during training and predict based on them during inference. In the real world, where such correlations are absent, their performance can deteriorate significantly. To avoid this, a common practice is to test whether predictions are reasonable. Along with this, a challenge known as the trustworthiness oracle problem has been introduced. Due to the lack of automated trustworthiness oracles, the assessment requires manual validation of the decision process disclosed by explanation methods, which is time-consuming and not scalable. We propose TOKI, the first automated trustworthiness oracle generation method for text classifiers, which automatically checks whether the prediction-contributing words are related to the predicted class using explanation methods and word embeddings. To demonstrate its practical usefulness, we introduce a novel adversarial attack method targeting trustworthiness issues identified by TOKI. We compare TOKI with a naive baseline based solely on model confidence using human-created ground truths of 6,000 predictions. We also compare TOKI-guided adversarial attack method with A2T, a SOTA adversarial attack method. Results show that relying on prediction uncertainty cannot distinguish between trustworthy and untrustworthy predictions, TOKI achieves 142% higher accuracy than the naive baseline, and TOKI-guided adversarial attack method is more effective with fewer perturbations than A2T.

Moir\'e superlattice of twisted hexagonal boron nitride (hBN) has emerged as an advanced atomically thin van der Waals interfacial ferroelectricity platform. Nanoscale periodic ferroelectric moir\'e domains with out-of-plane potentials in twisted hBN allow the hosting of remote Coulomb superlattice potentials to adjacent two-dimensional materials for tailoring strongly correlated properties. Therefore, the new strategies for engineering moir\'e length, angle, and potential strength are essential for developing programmable quantum materials and advanced twistronics applications devices. Here, we demonstrate the realization of twisted hBN-based moir\'e superlattice platforms and visualize the moir\'e domains and ferroelectric properties using Kelvin probe force microscopy. Also, we report the KPFM result of regular moir\'e superlattice in the large area. It offers the possibility to reproduce uniform moir\'e structures with precise control piezo stage stacking and heat annealing. We demonstrate the high tunability of twisted hBN moir\'e platforms and achieve cumulative multi-ferroelectric polarization and multi-level domains with multiple angle mismatched interfaces. Additionally, we observe the quasi-1D anisotropic moir\'e domains and show the highest resolution analysis of the local built-in strain between adjacent hBN layers compared to the conventional methods. Furthermore, we demonstrate in-situ manipulation of moir\'e superlattice potential strength using femtosecond pulse laser irradiation, which results in the optical phonon-induced atomic displacement at the hBN moir\'e interfaces. Our results pave the way to develop precisely programmable moir\'e superlattice platforms and investigate strongly correlated physics in van der Waals heterostructures., Comment: 26 pages, 4 figures

With the growing demand for personalized assortment recommendations, concerns over data privacy have intensified, highlighting the urgent need for effective privacy-preserving strategies. This paper presents a novel framework for privacy-preserving dynamic assortment selection using the multinomial logit (MNL) bandits model. Our approach employs a perturbed upper confidence bound method, integrating calibrated noise into user utility estimates to balance between exploration and exploitation while ensuring robust privacy protection. We rigorously prove that our policy satisfies Joint Differential Privacy (JDP), which better suits dynamic environments than traditional differential privacy, effectively mitigating inference attack risks. This analysis is built upon a novel objective perturbation technique tailored for MNL bandits, which is also of independent interest. Theoretically, we derive a near-optimal regret bound of $\tilde{O}(\sqrt{T})$ for our policy and explicitly quantify how privacy protection impacts regret. Through extensive simulations and an application to the Expedia hotel dataset, we demonstrate substantial performance enhancements over the benchmark method.

State-of-the-art text-to-image (T2I) diffusion models often struggle to generate rare compositions of concepts, e.g., objects with unusual attributes. In this paper, we show that the compositional generation power of diffusion models on such rare concepts can be significantly enhanced by the Large Language Model (LLM) guidance. We start with empirical and theoretical analysis, demonstrating that exposing frequent concepts relevant to the target rare concepts during the diffusion sampling process yields more accurate concept composition. Based on this, we propose a training-free approach, R2F, that plans and executes the overall rare-to-frequent concept guidance throughout the diffusion inference by leveraging the abundant semantic knowledge in LLMs. Our framework is flexible across any pre-trained diffusion models and LLMs, and can be seamlessly integrated with the region-guided diffusion approaches. Extensive experiments on three datasets, including our newly proposed benchmark, RareBench, containing various prompts with rare compositions of concepts, R2F significantly surpasses existing models including SD3.0 and FLUX by up to 28.1%p in T2I alignment. Code is available at https://github.com/krafton-ai/Rare2Frequent.

Large language models (LLMs) have recently shown significant potential in various biological tasks such as protein engineering and molecule design. These tasks typically involve black-box discrete sequence optimization, where the challenge lies in generating sequences that are not only biologically feasible but also adhere to hard fine-grained constraints. However, LLMs often struggle with such constraints, especially in biological contexts where verifying candidate solutions is costly and time-consuming. In this study, we explore the possibility of employing LLMs as highly-constrained bilevel optimizers through a methodology we refer to as Language Model Optimization with Margin Expectation (LLOME). This approach combines both offline and online optimization, utilizing limited oracle evaluations to iteratively enhance the sequences generated by the LLM. We additionally propose a novel training objective -- Margin-Aligned Expectation (MargE) -- that trains the LLM to smoothly interpolate between the reward and reference distributions. Lastly, we introduce a synthetic test suite that bears strong geometric similarity to real biophysical problems and enables rapid evaluation of LLM optimizers without time-consuming lab validation. Our findings reveal that, in comparison to genetic algorithm baselines, LLMs achieve significantly lower regret solutions while requiring fewer test function evaluations. However, we also observe that LLMs exhibit moderate miscalibration, are susceptible to generator collapse, and have difficulty finding the optimal solution when no explicit ground truth rewards are available., Comment: Supercedes arXiv:2407.00236v1

Deep learning-based expert models have reached superhuman performance in decision-making domains such as chess and Go. However, it is under-explored to explain or comment on given decisions although it is important for human education and model explainability. The outputs of expert models are accurate, but yet difficult to interpret for humans. On the other hand, large language models (LLMs) produce fluent commentary but are prone to hallucinations due to their limited decision-making capabilities. To bridge this gap between expert models and LLMs, we focus on chess commentary as a representative case of explaining complex decision-making processes through language and address both the generation and evaluation of commentary. We introduce Concept-guided Chess Commentary generation (CCC) for producing commentary and GPT-based Chess Commentary Evaluation (GCC-Eval) for assessing it. CCC integrates the decision-making strengths of expert models with the linguistic fluency of LLMs through prioritized, concept-based explanations. GCC-Eval leverages expert knowledge to evaluate chess commentary based on informativeness and linguistic quality. Experimental results, validated by both human judges and GCC-Eval, demonstrate that CCC generates commentary that is accurate, informative, and fluent.

We introduce a new class of quantum many-body dynamics in quantum simulations, namely 'pseudochaotic dynamics,' which generates computationally indistinguishable states from Haar-random states within the limited access to the measurement outcomes and runtime of quantum computations. While it is not chaotic, a defining characteristics of many-body quantum chaos, namely out-of-time-ordered correlators, fail to differentiate the pseudochaotic dynamics from chaotic one. We systematically construct such pseudochaotic unitary evolution and investigate their nature through extensive numerical and analytic calculations. Remarkably, we show that the pseudochaotic dynamics can generate a representative pseudo-quantum state, specifically a random subset-phase state, from initial computational states with a depth tightly bound by polylog(n) with the system size n, which opens up a practical route to realize pseudorandom states in near term quantum devices., Comment: 7 pages, 3 figures

Low-rank adaption (LoRA) is a widely used parameter-efficient finetuning method for LLM that reduces memory requirements. However, current LoRA optimizers lack transformation invariance, meaning the actual updates to the weights depends on how the two LoRA factors are scaled or rotated. This deficiency leads to inefficient learning and sub-optimal solutions in practice. This paper introduces LoRA-RITE, a novel adaptive matrix preconditioning method for LoRA optimization, which can achieve transformation invariance and remain computationally efficient. We provide theoretical analysis to demonstrate the benefit of our method and conduct experiments on various LLM tasks with different models including Gemma 2B, 7B, and mT5-XXL. The results demonstrate consistent improvements against existing optimizers. For example, replacing Adam with LoRA-RITE during LoRA fine-tuning of Gemma-2B yielded 4.6\% accuracy gain on Super-Natural Instructions and 3.5\% accuracy gain across other four LLM benchmarks (HellaSwag, ArcChallenge, GSM8K, OpenBookQA).

In recent years, Large Language Models (LLMs) have become fundamental to a broad spectrum of artificial intelligence applications. As the use of LLMs expands, precisely estimating the uncertainty in their predictions has become crucial. Current methods often struggle to accurately identify, measure, and address the true uncertainty, with many focusing primarily on estimating model confidence. This discrepancy is largely due to an incomplete understanding of where, when, and how uncertainties are injected into models. This paper introduces a comprehensive framework specifically designed to identify and understand the types and sources of uncertainty, aligned with the unique characteristics of LLMs. Our framework enhances the understanding of the diverse landscape of uncertainties by systematically categorizing and defining each type, establishing a solid foundation for developing targeted methods that can precisely quantify these uncertainties. We also provide a detailed introduction to key related concepts and examine the limitations of current methods in mission-critical and safety-sensitive applications. The paper concludes with a perspective on future directions aimed at enhancing the reliability and practical adoption of these methods in real-world scenarios.

Identifying the dominant ionizing sources in galaxies is essential for understanding their formation and evolution. Traditionally, spectra are classified based on their dominant ionizing source using strong emission lines and Baldwin, Phillips, \& Terlevich (BPT) diagrams. The ionizing source is traditionally determined by the emission line ratios using the BPT diagrams. Low-Ionization Nuclear Emission-line Regions (LINERs) are a class of ionizing mechanisms that is observationally identified but with a poorly understood origin, unlike the case of star forming regions and active galactic nuclei (AGN). LINERs, typically found in early-type galaxies, are often associated with low-luminosity AGN activity but may also be powered by aging stellar populations, particularly post-Asymptotic Giant Branch (p-AGB) stars. In this study, we employ a machine-learning-based encoder, Spender, to analyze the full MaNGA IFU spectra and identify key spectral features of LINERs. By examining the continuum and line emission of these spaxels, our approach aims to uncover hidden patterns and better understand the dominant ionizing sources. We show in this work that the neural network-based encoder was able identify LINER sources from the stellar continuum alone. The characteristics of the stellar population underlying LINER regions are consistent with evolved low mass stars implying that the source driving LINER emission is probably p-AGB stars rather than AGN activity.

Financial intelligence generation from vast data sources has typically relied on traditional methods of knowledge-graph construction or database engineering. Recently, fine-tuned financial domain-specific Large Language Models (LLMs), have emerged. While these advancements are promising, limitations such as high inference costs, hallucinations, and the complexity of concurrently analyzing high-dimensional financial data, emerge. This motivates our invention FISHNET (Financial Intelligence from Sub-querying, Harmonizing, Neural-Conditioning, Expert swarming, and Task planning), an agentic architecture that accomplishes highly complex analytical tasks for more than 98,000 regulatory filings that vary immensely in terms of semantics, data hierarchy, or format. FISHNET shows remarkable performance for financial insight generation (61.8% success rate over 5.0% Routing, 45.6% RAG R-Precision). We conduct rigorous ablations to empirically prove the success of FISHNET, each agent's importance, and the optimized performance of assembling all agents. Our modular architecture can be leveraged for a myriad of use-cases, enabling scalability, flexibility, and data integrity that are critical for financial tasks., Comment: Accepted at the 5th ACM International Conference on AI in Finance (ICAIF '24)

We give a comprehensive account of zero mean curvature surfaces in isotropic 3-space with planar curvature lines. After giving a complete classification all such surfaces, we show that they belong to a 1-parameter family of surfaces. We then investigate their relationship to Thomsen-type surfaces in isotropic 3-space, those zero mean curvature surfaces in isotropic 3-space that are also affine minimal., Comment: 25 pages, 6 figures

Generating high-quality charts with Large Language Models presents significant challenges due to limited data and the high cost of scaling through human curation. Instruction, data, and code triplets are scarce and expensive to manually curate as their creation demands technical expertise. To address this scalability issue, we introduce a reference-free automatic feedback generator, which eliminates the need for costly human intervention. Our novel framework, $C^2$, consists of (1) an automatic feedback provider (ChartAF) and (2) a diverse, reference-free dataset (ChartUIE-8K). Quantitative results are compelling: in our first experiment, 74% of respondents strongly preferred, and 10% preferred, the results after feedback. The second post-feedback experiment demonstrates that ChartAF outperforms nine baselines. Moreover, ChartUIE-8K significantly improves data diversity by increasing queries, datasets, and chart types by 5982%, 1936%, and 91%, respectively, over benchmarks. Finally, an LLM user study revealed that 94% of participants preferred ChartUIE-8K's queries, with 93% deeming them aligned with real-world use cases. Core contributions are available as open-source at an anonymized project site, with ample qualitative examples., Comment: Preprint

This paper explores integrating Automatic Speech Recognition (ASR) into natural language query systems to improve weather forecasting efficiency for Korean meteorologists. We address challenges in developing ASR systems for the Korean weather domain, specifically specialized vocabulary and Korean linguistic intricacies. To tackle these issues, we constructed an evaluation dataset of spoken queries recorded by native Korean speakers. Using this dataset, we assessed various configurations of a multilingual ASR model family, identifying performance limitations related to domain-specific terminology. We then implemented a simple text-to-speech-based data augmentation method, which improved the recognition of specialized terms while maintaining general-domain performance. Our contributions include creating a domain-specific dataset, comprehensive ASR model evaluations, and an effective augmentation technique. We believe our work provides a foundation for future advancements in ASR for the Korean weather forecasting domain.

The origin of nonthermal broadening in solar spectra is one of the long-standing questions in solar physics. Various processes have been invoked - including unresolved flows, waves, and turbulent processes - but definitive answers are lacking. To investigate the physical processes responsible for nonthermal broadening, we examine its relation with the angle between the magnetic field and the line of sight in three different closed-field regions above plage regions at different locations on the solar disk. We obtained the nonthermal width of transition-region Si IV 1403 {\AA} spectra observed in active regions by the Interface Region Imaging Spectrograph, after subtraction of the thermal and instrumental line broadening. To investigate the dependence of the measured broadening on the viewing angle between the line of sight and magnetic field direction, we determined the magnetic field direction at transition-region heights using nonlinear force-free extrapolations based on the observed photospheric vector magnetic field taken by the Helioseismic and Magnetic Imager on board the Solar Dynamics Observatory. We found that the nonthermal broadening shows a correlation with downward motion (redshifts)and alignment between the magnetic field and the observer's line-of-sight direction. Based on the observed correlations, we suggest that velocity gradients within plasma flowing down along the magnetic field may lead to a significant portion of the observed nonthermal broadening of transition-region spectral lines in closed fields above plage regions., Comment: 11 pages, 8 figures

Thermal Infrared (TIR) imaging provides robust perception for navigating in challenging outdoor environments but faces issues with poor texture and low image contrast due to its 14/16-bit format. Conventional methods utilize various tone-mapping methods to enhance contrast and photometric consistency of TIR images, however, the choice of tone-mapping is largely dependent on knowing the task and temperature dependent priors to work well. In this paper, we present Thermal Chameleon Network (TCNet), a task-adaptive tone-mapping approach for RAW 14-bit TIR images. Given the same image, TCNet tone-maps different representations of TIR images tailored for each specific task, eliminating the heuristic image rescaling preprocessing and reliance on the extensive prior knowledge of the scene temperature or task-specific characteristics. TCNet exhibits improved generalization performance across object detection and monocular depth estimation, with minimal computational overhead and modular integration to existing architectures for various tasks. Project Page: https://github.com/donkeymouse/ThermalChameleon, Comment: Published in IEEE Robotics and Automation Letters (2024)