Miracle-dz/UniFAR-FTUs huggingface dataset:
NORA-Surge: A high resolution storm surge hindcast for the Norwegian Sea, the North Sea and the Barents Sea

A high-resolution hindcast archive around the coast of Norway spanning the time period 1979-2022 is presented. The model is found to perform well with forcing from the NORA3 atmospheric hindcast. Observations from water level gauges along the coasts of the North Sea and the Norwegian Sea are used to assess the performance of the hindcast, which is generally found to be in good agreement. In addition, 100-year return level estimates are calculated from the hindcast.
OVD-Explorer: Optimism Should Not Be the Sole Pursuit of Exploration in Noisy Environments

In reinforcement learning, the optimism in the face of uncertainty (OFU) is a mainstream principle for directing exploration towards less explored areas, characterized by higher uncertainty. However, in the presence of environmental stochasticity (noise), purely optimistic exploration may lead to excessive probing of high-noise areas, consequently impeding exploration efficiency. Hence, in exploring noisy environments, while optimism-driven exploration serves as a foundation, prudent attention to alleviating unnecessary over-exploration in high-noise areas becomes beneficial. In this work, we propose Optimistic Value Distribution Explorer (OVD-Explorer) to achieve a noise-aware optimistic exploration for continuous control. OVD-Explorer proposes a new measurement of the policy's exploration ability considering noise in optimistic perspectives, and leverages gradient ascent to drive exploration. Practically, OVD-Explorer can be easily integrated with continuous control RL algorithms. Extensive evaluations on the MuJoCo and GridChaos tasks demonstrate the superiority of OVD-Explorer in achieving noise-aware optimistic exploration.
Learning Subject-Aware Cropping by Outpainting Professional Photos

How to frame (or crop) a photo often depends on the image subject and its context; e.g., a human portrait. Recent works have defined the subject-aware image cropping task as a nuanced and practical version of image cropping. We propose a weakly-supervised approach (GenCrop) to learn what makes a high-quality, subject-aware crop from professional stock images. Unlike supervised prior work, GenCrop requires no new manual annotations beyond the existing stock image collection. The key challenge in learning from this data, however, is that the images are already cropped and we do not know what regions were removed. Our insight is to combine a library of stock images with a modern, pre-trained text-to-image diffusion model. The stock image collection provides diversity, and its images serve as pseudo-labels for a good crop. The text-image diffusion model is used to out-paint (i.e., outward inpainting) realistic uncropped images. Using this procedure, we are able to automatically generate a large dataset of cropped-uncropped training pairs to train a cropping model. Despite being weakly-supervised, GenCrop is competitive with state-of-the-art supervised methods and significantly better than comparable weakly-supervised baselines on quantitative and qualitative evaluation metrics.
Speech and Text-Based Emotion Recognizer

Affective computing is a field of study that focuses on developing systems and technologies that can understand, interpret, and respond to human emotions. Speech Emotion Recognition (SER), in particular, has got a lot of attention from researchers in the recent past. However, in many cases, the publicly available datasets, used for training and evaluation, are scarce and imbalanced across the emotion labels. In this work, we focused on building a balanced corpus from these publicly available datasets by combining these datasets as well as employing various speech data augmentation techniques. Furthermore, we experimented with different architectures for speech emotion recognition. Our best system, a multi-modal speech, and text-based model, provides a performance of UA(Unweighed Accuracy) + WA (Weighed Accuracy) of 157.57 compared to the baseline algorithm performance of 119.66
Designing LLM Chains by Adapting Techniques from Crowdsourcing Workflows

LLM chains enable complex tasks by decomposing work into a sequence of sub-tasks. Crowdsourcing workflows similarly decompose complex tasks into smaller tasks for human crowdworkers. Chains address LLM errors analogously to the way crowdsourcing workflows address human error. To characterize opportunities for LLM chaining, we survey 107 papers across the crowdsourcing and chaining literature to construct a design space for chain development. The design space connects an LLM designer's objectives to strategies they can use to achieve those objectives, and tactics to implement each strategy. To explore how techniques from crowdsourcing may apply to chaining, we adapt crowdsourcing workflows to implement LLM chains across three case studies: creating a taxonomy, shortening text, and writing a short story. From the design space and our case studies, we identify which techniques transfer from crowdsourcing to LLM chaining and raise implications for future research and development.
In Vivo GABA Detection by Single Pulse Editing with One Shot

Over the past two decades, magnetic resonance spectroscopy with two-shot difference editing has been widely employed to characterize altered levels of GABA, the primary inhibitory neurotransmitter in the brain, in various neuropsychiatric disorders. This conventional technique detects the GABA H4 resonance, making it unsuitable for investigating GABA metabolism. It also suffers from subtraction artifacts, signal loss, and significant contamination by macromolecules. Here, we introduce a single-shot method for detecting GABA H2, effectively overcoming these difficulties. Since GABA turnover initiates at its protonated C2 and unprotonated C1 positions, we demonstrate, for the first time, noninvasive real-time monitoring of GABA metabolism in the human brain, utilizing GABA H2 as a highly sensitive reporter for GABA C2. This new method not only enhances the quantitative measurement of GABA levels but also opens up a new avenue to probe the metabolic processes underlying alterations in GABA levels in patients.
Improved Reall-Santos method for AdS black holes in general higher derivative gravities

For asymptotically flat black holes, Reall-Santos method is a convenient tool to compute leading higher derivative corrections to the thermodynamic quantities without actually solving the modified field equations. However, there are subtleties in its generalization to asymptotically AdS black holes with general higher derivative corrections. First of all, it is necessary to know all the higher derivative holographic counterterms and the surface terms implementing the variational principle and subtracting the divergence. One then needs to solve for the modified AdS radius and rescale the time coordinate in an appropriate way such that the induced metric on the conformal boundary of AdS black hole is not modified. We observe that Reall-Santos method can be directly applied to a particular 4-derivative gravity model, known as the Einstein-Weyl gravity, which does not modified the AdS radius and requires only the Gibbons-Hawking-York term and holographic counterterms for the 2-derivative theory. We thus suggest that to compute the thermodynamic quantities of AdS black holes in general 4-derivative theories of gravity, one simply needs to transform it to a Einstein-Weyl gravity with identical thermodynamic variables by appropriate field redefinitions. We explicitly verify this proposal with spherically-symmetric and static charged black holes in Einstein-Maxwell theory extended with generic 4-derivative interactions.
When Model Meets New Normals: Test-time Adaptation for Unsupervised Time-series Anomaly Detection

Time-series anomaly detection deals with the problem of detecting anomalous timesteps by learning normality from the sequence of observations. However, the concept of normality evolves over time, leading to a "new normal problem", where the distribution of normality can be changed due to the distribution shifts between training and test data. This paper highlights the prevalence of the new normal problem in unsupervised time-series anomaly detection studies. To tackle this issue, we propose a simple yet effective test-time adaptation strategy based on trend estimation and a self-supervised approach to learning new normalities during inference. Extensive experiments on real-world benchmarks demonstrate that incorporating the proposed strategy into the anomaly detector consistently improves the model's performances compared to the existing baselines, leading to robustness to the distribution shifts.
Factors affecting nest site selection and reproductive success of tundra nesting shorebirds

References: Lyon, B. , and R. Montgomerie. 1987. Ecological correlates of incubation feeding: a comparative study of high arctic finches. Ecology 68:713-722. Clark, R. G. , and D. Shutler. 1999. Avian habitat selection: pattern from process in nest-site use by ducks. Ecology 80:272-287. Martin, T. E. 1995. Avian life history evolution in relation to nest sites, nest predation, and food. Ecological Monographs 65:101-127. Bety J., G. Gauthier, E. Korpimaki, and J. F. Giroux. 2002. Shared predators and indirect trophic interactions: lemming cycles and arcticnesting geese. Journal of Animal Ecology 71:88-98. Acknowledgements: Canadian Wildlife Service, Dr. Erica Nol, Natural Science and Engineering Research Council, Northern Scientific Training Program, Polar Continental Shelf Project The University of Brit ish Colum bia
New classes of the greedy-applicable arm feature distributions in the sparse linear bandit problem

We consider the sparse contextual bandit problem where arm feature affects reward through the inner product of sparse parameters. Recent studies have developed sparsity-agnostic algorithms based on the greedy arm selection policy. However, the analysis of these algorithms requires strong assumptions on the arm feature distribution to ensure that the greedily selected samples are sufficiently diverse; One of the most common assumptions, relaxed symmetry, imposes approximate origin-symmetry on the distribution, which cannot allow distributions that has origin-asymmetric support. In this paper, we show that the greedy algorithm is applicable to a wider range of the arm feature distributions from two aspects. Firstly, we show that a mixture distribution that has a greedy-applicable component is also greedy-applicable. Second, we propose new distribution classes, related to Gaussian mixture, discrete, and radial distribution, for which the sample diversity is guaranteed. The proposed classes can describe distributions with origin-asymmetric support and, in conjunction with the first claim, provide theoretical guarantees of the greedy policy for a very wide range of the arm feature distributions.
Mixture of Cluster-conditional LoRA Experts for Vision-language Instruction Tuning

Instruction tuning of Large Vision-language Models (LVLMs) has revolutionized the development of versatile models with zero-shot generalization across a wide range of downstream vision-language tasks. However, the diversity of training tasks of different sources and formats would lead to inevitable task conflicts, where different tasks conflict for the same set of model parameters, resulting in sub-optimal instructionfollowing abilities. To address that, we propose the Mixture of Clusterconditional LoRA Experts (MoCLE), a novel Mixture of Experts (MoE) architecture designed to activate the task-customized model parameters based on the instruction clusters. A separate universal expert is further incorporated to improve generalization capabilities of MoCLE for novel instructions. Extensive experiments on 11 zero-shot tasks demonstrate the effectiveness of MoCLE.
Hunting for Hydrated Minerals on Trans-Neptunian Objects

We present new optical reflectance spectra of three potentially silicate-rich trans-Neptunian objects (TNOs). These spectra were obtained with the aim of confirming past hints and detections of λ ∼ 0.7 μm absorption features associated with the presence of iron-bearing phyllosilicates. Our new spectrum of 120216 (2004 EW95) presents clearly detected absorption features that are similar in shape to hydrated mineral absorption bands present in the spectra of aqueously altered outer main belt asteroids. Four new reflectance spectra of 208996 (2003 AZ84) obtained at separate epochs all appear featureless, but they vary significantly in spectral gradient (between ∼3.5%/0.1 μm and ∼8.5%/0.1 μm) on a timescale consistent with this object’s nominal rotational period. We report the first four optical reflectance spectra of 90568 (2004 GV9), finding them all to be featureless but consistent with colors previously reported for this object. We speculate that impacts are the only mechanism capable of delivering, excavating, or forming hydrated minerals at the surfaces of TNOs in detectable concentrations; as a result, any deposits of hydrated minerals on TNOs are predicted to be localized and associated with impact sites. Globally altered TNOs (as observationally suggested for 2004 EW95) plausibly formed more easily at smaller heliocentric distances (r H < 15 au) before being transplanted into the current trans-Neptunian population.
Hierarchical and Incremental Structural Entropy Minimization for Unsupervised Social Event Detection

As a trending approach for social event detection, graph neural network (GNN)-based methods enable a fusion of natural language semantics and the complex social network structural information, thus showing SOTA performance. However, GNN-based methods can miss useful message correlations. Moreover, they require manual labeling for training and predetermining the number of events for prediction. In this work, we address social event detection via graph structural entropy (SE) minimization. While keeping the merits of the GNN-based methods, the proposed framework, HISEvent, constructs more informative message graphs, is unsupervised, and does not require the number of events given a priori. Specifically, we incrementally explore the graph neighborhoods using 1-dimensional (1D) SE minimization to supplement the existing message graph with edges between semantically related messages. We then detect events from the message graph by hierarchically minimizing 2-dimensional (2D) SE. Our proposed 1D and 2D SE minimization algorithms are customized for social event detection and effectively tackle the efficiency problem of the existing SE minimization algorithms. Extensive experiments show that HISEvent consistently outperforms GNN-based methods and achieves the new SOTA for social event detection under both closed- and open-set settings while being efficient and robust.
ABiMed: An intelligent and visual clinical decision support system for medication reviews and polypharmacy management

Background: Polypharmacy, i.e. taking five drugs or more, is both a public health and an economic issue. Medication reviews are structured interviews of the patient by the community pharmacist, aiming at optimizing the drug treatment and deprescribing useless, redundant or dangerous drugs. However, they remain difficult to perform and time-consuming. Several clinical decision support systems were developed for helping clinicians to manage polypharmacy. However, most were limited to the implementation of clinical practice guidelines. In this work, our objective is to design an innovative clinical decision support system for medication reviews and polypharmacy management, named ABiMed. Methods: ABiMed associates several approaches: guidelines implementation, but the automatic extraction of patient data from the GP's electronic health record and its transfer to the pharmacist, and the visual presentation of contextualized drug knowledge using visual analytics. We performed an ergonomic assessment and qualitative evaluations involving pharmacists and GPs during focus groups and workshops. Results: We describe the proposed architecture, which allows a collaborative multi-user usage. We present the various screens of ABiMed for entering or verifying patient data, for accessing drug knowledge (posology, adverse effects, interactions), for viewing STOPP/START rules and for suggesting modification to the treatment. Qualitative evaluations showed that health professionals were highly interested by our approach, associating the automatic guidelines execution with the visual presentation of drug knowledge. Conclusions: The association of guidelines implementation with visual presentation of knowledge is a promising approach for managing polypharmacy. Future works will focus on the improvement and the evaluation of ABiMed.
Domain Generalization in LiDAR Semantic Segmentation Leveraged by Density Discriminative Feature Embedding

While significant progress has been achieved in LiDAR-based perception, domain generalization continues to present challenges, often resulting in reduced performance when encountering unfamiliar datasets due to domain discrepancies. One of the primary hurdles stems from the variability of LiDAR sensors, leading to inconsistencies in point cloud density distribution. Such inconsistencies can undermine the effectiveness of perception models. We address this challenge by introducing a new approach that acknowledges a fundamental characteristic of LiDAR: the variation in point density due to the distance from the LiDAR to the scene, and the number of beams relative to the field of view. Understanding this, we view each LiDAR's point cloud at various distances as having distinct density distributions, which can be consistent across different LiDAR models. With this insight, we propose the Density Discriminative Feature Embedding (DDFE) module, crafted to specifically extract features related to density while ensuring domain invariance across different LiDAR sensors. In addition, we introduce a straightforward but effective density augmentation technique, designed to broaden the density spectrum and enhance the capabilities of the DDFE. The proposed DDFE stands out as a versatile and lightweight domain generalization module. It can be seamlessly integrated into various 3D backbone networks, consistently outperforming existing state-of-the-art domain generalization approaches. We commit to releasing the source code publicly to foster community collaboration and advancement.
Probabilistic Prediction of Longitudinal Trajectory Considering Driving Heterogeneity with Interpretability

Automated vehicles are envisioned to navigate safely in complex mixed-traffic scenarios alongside human-driven vehicles. To promise a high degree of safety, accurately predicting the maneuvers of surrounding vehicles and their future positions is a critical task and attracts much attention. However, most existing studies focused on reasoning about positional information based on objective historical trajectories without fully considering the heterogeneity of driving behaviors. Therefore, this study proposes a trajectory prediction framework that combines Mixture Density Networks (MDN) and considers the driving heterogeneity to provide probabilistic and personalized predictions. Specifically, based on a certain length of historical trajectory data, the situation-specific driving preferences of each driver are identified, where key driving behavior feature vectors are extracted to characterize heterogeneity in driving behavior among different drivers. With the inputs of the short-term historical trajectory data and key driving behavior feature vectors, a probabilistic LSTMMD-DBV model combined with LSTM-based encoder-decoder networks and MDN layers is utilized to carry out personalized predictions. Finally, the SHapley Additive exPlanations (SHAP) method is employed to interpret the trained model for predictions. The proposed framework is tested based on a wide-range vehicle trajectory dataset. The results indicate that the proposed model can generate probabilistic future trajectories with remarkably improved predictions compared to existing benchmark models. Moreover, the results confirm that the additional input of driving behavior feature vectors representing the heterogeneity of driving behavior could provide more information and thus contribute to improving the prediction accuracy.
Shaping Political Discourse using multi-source News Summarization

Multi-document summarization is the process of automatically generating a concise summary of multiple documents related to the same topic. This summary can help users quickly understand the key information from a large collection of documents. Multi-document summarization systems are more complex than single-document summarization systems due to the need to identify and combine information from multiple sources. In this paper, we have developed a machine learning model that generates a concise summary of a topic from multiple news documents. The model is designed to be unbiased by sampling its input equally from all the different aspects of the topic, even if the majority of the news sources lean one way.
Integrating Human Vision Perception in Vision Transformers for Classifying Waste Items

In this paper, we propose an novel methodology aimed at simulating the learning phenomenon of nystagmus through the application of differential blurring on datasets. Nystagmus is a biological phenomenon that influences human vision throughout life, notably by diminishing head shake from infancy to adulthood. Leveraging this concept, we address the issue of waste classification, a pressing global concern. The proposed framework comprises two modules, with the second module closely resembling the original Vision Transformer, a state-of-the-art model model in classification tasks. The primary motivation behind our approach is to enhance the model's precision and adaptability, mirroring the real-world conditions that the human visual system undergoes. This novel methodology surpasses the standard Vision Transformer model in waste classification tasks, exhibiting an improvement with a margin of 2%. This improvement underscores the potential of our methodology in improving model precision by drawing inspiration from human vision perception. Further research in the proposed methodology could yield greater performance results, and can be extrapolated to other global issues.
Fay identities of Pfaffian type for hyperelliptic curves

We establish identities of Pfaffian type for the theta function associated with twice or half the period matrix of a hyperelliptic curve. They are implied by the large size asymptotic analysis of exact Pfaffian identities for expectation values of ratios of characteristic polynomials in ensembles of orthogonal or quaternionic self-dual random matrices. We show that they amount to identities for the theta function with the period matrix of a hyperelliptic curve, and in this form we reprove them by direct geometric methods.
Quantum metrics on crossed products with groups of polynomial growth

We show how to equip the crossed product between a group of polynomial growth and a compact quantum metric space with a compact quantum metric space structure. When the quantum metric on the base space arises from a spectral triple, which is compatible with the action of the group, we furthermore show that the crossed product becomes a spectral metric space. Lastly, we analyse the spectral triple at the crossed product level from the point of view of unbounded $KK$-theory and show that it arises as an internal Kasparov product of unbounded Kasparov modules.