Reviewerly/exHarmony huggingface dataset:
Regressive class models for machine learning algorithms to predict trajectories of repeated multinomial outcomes: an application to the activity of daily living of elderly data

Authors:
raw_author_name: R. I. Chowdhury
raw_affiliation_string: Shannon School of Business, Cape Breton University, Sydney, Canada
raw_author_name: M. T. Hasan
raw_affiliation_string: Department of Mathematics and Statistics, University of New Brunswick, Fredericton, Canada
raw_author_name: G. Sneddon
raw_affiliation_string: Mathematics Department, Mount Saint Vincent University, Halifax, Canada

Abstract: Due to the advancement of electronic data capturing, the amount of repeated categorical data being collected and stored has increased. This massive amount of data is complex and poses significant statistical challenges in methodology and computation. To analyze such big data, the divide and recombine method is commonly used. First, a large data set is partitioned into subsets, and each subset is analyzed separately. Then, the results are recombined in a manner that produces statistically valid output. However, available literature can only accommodate cross-sectional data. We propose a new simpler approach to analyze large, repeated categorical data using a joint modeling framework. In the proposed method, follow-up time is a natural conditioning variable that allows big data to be divided into subsets. Then, using the relationship between joint, marginal, and conditional probabilities, we can recombine the results in a statistically valid way. Several machine learning algorithms for cross-sectional data are extended for repeated outcomes to predict trajectories using the proposed framework. As an illustration, the proposed methodology is used to analyze repeatedly measured activity of daily living (ADL) data from the Health and Retirement Study (HRS), USA. We also check model performances under multiple machine learning algorithms using bootstrap simulations.
A fast and gridless ORKA algorithm for tracking moving and deforming  objects

Authors:
raw_author_name: Ma, Jianwei
raw_author_name: wu, Wenze

Abstract: Identifying objects in given data is a task frequently encountered in many applications. Finding vehicles or persons in video data, tracking seismic waves in geophysical exploration data, or predicting a storm front movement from meteorological measurements are only some of the possible applications. In many cases, the object of interest changes its form or position from one measurement to another. For example, vehicles in a video may change its position or angle to the camera in each frame. Seismic waves can change its arrival time, frequency, or intensity depending on the sensor position. Storm fronts can change its form and position over time. This complicates the identification and tracking as the algorithm needs to deal with the changing object over the given measurements. In a previous work, the authors presented a new algorithm to solve this problem - Object reconstruction using K-approximation (ORKA). The algorithm can solve the problem at hand but suffers from two disadvantages. On the one hand, the reconstructed object movement is bound to a grid that depends on the data resolution. On the other hand, the complexity of the algorithm increases exponentially with the resolution. We overcome both disadvantages by introducing an iterative strategy that uses a resampling method to create multiple resolutions of the data. In each iteration the resolution is increased to reconstruct more details of the object of interest. This way, we can even go beyond the original resolution by artificially upsampling the data. We give error bounds and a complexity analysis of the new method. Furthermore, we analyze its performance in several numerical experiments as well as on real data. We also give a brief introduction on the original ORKA algorithm. Knowledge of the previous work is thus not required.
PoCo: Policy Composition from and for Heterogeneous Robot Learning

Authors:
raw_author_name: Wang, Lirui
raw_author_name: Zhao, Jialiang
raw_author_name: Du, Yilun
raw_author_name: Tedrake, Russ

Abstract: Training general robotic policies from heterogeneous data for different tasks is a significant challenge. Existing robotic datasets vary in different modalities such as color, depth, tactile, and proprioceptive information, and collected in different domains such as simulation, real robots, and human videos. Current methods usually collect and pool all data from one domain to train a single policy to handle such heterogeneity in tasks and domains, which is prohibitively expensive and difficult. In this work, we present a flexible approach, dubbed Policy Composition, to combine information across such diverse modalities and domains for learning scene-level and task-level generalized manipulation skills, by composing different data distributions represented with diffusion models. Our method can use task-level composition for multi-task manipulation and be composed with analytic cost functions to adapt policy behaviors at inference time. We train our method on simulation, human, and real robot data and evaluate in tool-use tasks. The composed policy achieves robust and dexterous performance under varying scenes and tasks and outperforms baselines from a single data source in both simulation and real-world experiments. See https://liruiw.github.io/policycomp for more details .
Evading Data Contamination Detection for Language Models is (too) Easy

Authors:
raw_author_name: Müller, Mark Niklas
raw_author_name: Baader, Maximilian
raw_author_name: Fischer, Marc
raw_author_name: Vechev, Martin

Abstract: Large language models are widespread, with their performance on benchmarks frequently guiding user preferences for one model over another. However, the vast amount of data these models are trained on can inadvertently lead to contamination with public benchmarks, thus compromising performance measurements. While recently developed contamination detection methods try to address this issue, they overlook the possibility of deliberate contamination by malicious model providers aiming to evade detection. We argue that this setting is of crucial importance as it casts doubt on the reliability of public benchmarks. To more rigorously study this issue, we propose a categorization of both model providers and contamination detection methods. This reveals vulnerabilities in existing methods that we exploit with EAL, a simple yet effective contamination technique that significantly inflates benchmark performance while completely evading current detection methods.
Precedence-Constrained Winter Value for Effective Graph Data Valuation

Authors:
raw_author_name: Wei, Jin
raw_author_name: Aggarwal, Charu
raw_author_name: Ma, Yao

Abstract: Data valuation is essential for quantifying data's worth, aiding in assessing data quality and determining fair compensation. While existing data valuation methods have proven effective in evaluating the value of Euclidean data, they face limitations when applied to the increasingly popular graph-structured data. Particularly, graph data valuation introduces unique challenges, primarily stemming from the intricate dependencies among nodes and the exponential growth in value estimation costs. To address the challenging problem of graph data valuation, we put forth an innovative solution, Precedence-Constrained Winter (PC-Winter) Value, to account for the complex graph structure. Furthermore, we develop a variety of strategies to address the computational challenges and enable efficient approximation of PC-Winter. Extensive experiments demonstrate the effectiveness of PC-Winter across diverse datasets and tasks.
Improving Hardenability Modeling: A Bayesian Optimization Approach to Tuning Hyperparameters for Neural Networks Regression

Authors:
raw_author_name: Wojciech Sitek

Abstract: This study investigates the application of regression neural networks, in particular the fitrnet model, in predicting the hardness of steels. The experiments involve extensive tuning of hyperparameters using Bayesian optimization and employ 5-fold and 10-fold cross-validation schemes. The trained models are rigorously evaluated, and their performances are compared using various metrics such as mean square error (MSE), root mean square error (RMSE), mean absolute error (MAE), and coefficient of determination (R2). The results provide valuable insights into the effectiveness of the models and their ability to generalize to unseen data. In particular, Model 4208 (8-85-141-1) emerges as the top performer with an impressive RMSE of 1.0790 and an R² of 0.9900. The research paper contains an illustrative example that demonstrates the practical application of the developed model in determining the hardenability band for a specific steel grade and shows the effectiveness of the model in predicting and optimizing heat treatment results.
Efficacy of virtual purification-based error mitigation on quantum metrology

Authors:
raw_author_name: Hyukgun Kwon
raw_affiliation_string: Department of Physics and Astronomy, Seoul National University, Seoul 08826, Republic of Korea
raw_author_name: Changhun Oh
raw_affiliation_string: Pritzker School of Molecular Engineering, University of Chicago, Chicago, Illinois 60637, USA
raw_author_name: Youngrong Lim
raw_affiliation_string: School of Computational Sciences, Korea Institute for Advanced Study, Seoul 02455, Republic of Korea
raw_author_name: Hyunseok Jeong
raw_affiliation_string: Department of Physics and Astronomy, Seoul National University, Seoul 08826, Republic of Korea
raw_author_name: Liang Jiang
raw_affiliation_string: Pritzker School of Molecular Engineering, University of Chicago, Chicago, Illinois 60637, USA

Abstract: Noise is the main source that hinders us from fully exploiting quantum advantages in various quantum informational tasks. However, characterizing and calibrating the effect of noise is not always feasible in practice. Especially for quantum parameter estimation, an estimator constructed without precise knowledge of noise entails an inevitable bias. Recently, virtual purification-based error mitigation (VPEM) has been proposed to apply for quantum metrology to reduce such a bias occurring from unknown noise. While it was demonstrated to work for particular cases, whether VPEM always reduces a bias for general estimation schemes is unclear. For more general applications of VPEM to quantum metrology, we study factors determining whether VPEM can reduce the bias. We find that the closeness between the dominant eigenvector of a noisy state and the ideal quantum probe (without noise) with respect to an observable determines the reducible amount of bias by VPEM. Next, we show that one should carefully choose the reference point of the target parameter, which gives a smaller bias than others because the bias depends on the reference point. Otherwise, even if the dominant eigenvector and the ideal quantum probe are close, the bias of the mitigated case could be larger than the nonmitigated one. Finally, we analyze the error mitigation for a phase estimation scheme under various noises. Based on our analysis, we predict whether VPEM can effectively reduce a bias and numerically verify our results.
Cross-Domain Few-Shot Object Detection via Enhanced Open-Set Object  Detector

Authors:
raw_author_name: Fu, Yuqian
raw_author_name: Wang, Yu
raw_author_name: Pan, Yixuan
raw_author_name: Huai, Lian
raw_author_name: Shangguan, Zeyu
raw_author_name: Liu, Tong
raw_author_name: Kong, Lingjie
raw_author_name: Fu, Yanwei
raw_author_name: Van Gool, Luc
raw_author_name: Jiang, Xingqun

Abstract: This paper addresses the challenge of cross-domain few-shot object detection (CD-FSOD), aiming to develop an accurate object detector for novel domains with minimal labeled examples. While transformer-based open-set detectors e.g., DE-ViT~\cite{zhang2023detect} have excelled in both open-vocabulary object detection and traditional few-shot object detection, detecting categories beyond those seen during training, we thus naturally raise two key questions: 1) can such open-set detection methods easily generalize to CD-FSOD? 2) If no, how to enhance the results of open-set methods when faced with significant domain gaps? To address the first question, we introduce several metrics to quantify domain variances and establish a new CD-FSOD benchmark with diverse domain metric values. Some State-Of-The-Art (SOTA) open-set object detection methods are evaluated on this benchmark, with evident performance degradation observed across out-of-domain datasets. This indicates the failure of adopting open-set detectors directly for CD-FSOD. Sequentially, to overcome the performance degradation issue and also to answer the second proposed question, we endeavor to enhance the vanilla DE-ViT. With several novel components including finetuning, a learnable prototype module, and a lightweight attention module, we present an improved Cross-Domain Vision Transformer for CD-FSOD (CD-ViTO). Experiments show that our CD-ViTO achieves impressive results on both out-of-domain and in-domain target datasets, establishing new SOTAs for both CD-FSOD and FSOD. All the datasets, codes, and models will be released to the community.
High-dimensional Bayesian Optimization via Covariance Matrix Adaptation  Strategy

Authors:
raw_author_name: Ngo, Lam
raw_author_name: Ha, Huong
raw_author_name: Chan, Jeffrey
raw_author_name: Nguyen, Vu
raw_author_name: Zhang, Hongyu

Abstract: Bayesian Optimization (BO) is an effective method for finding the global optimum of expensive black-box functions. However, it is well known that applying BO to high-dimensional optimization problems is challenging. To address this issue, a promising solution is to use a local search strategy that partitions the search domain into local regions with high likelihood of containing the global optimum, and then use BO to optimize the objective function within these regions. In this paper, we propose a novel technique for defining the local regions using the Covariance Matrix Adaptation (CMA) strategy. Specifically, we use CMA to learn a search distribution that can estimate the probabilities of data points being the global optimum of the objective function. Based on this search distribution, we then define the local regions consisting of data points with high probabilities of being the global optimum. Our approach serves as a meta-algorithm as it can incorporate existing black-box BO optimizers, such as BO, TuRBO, and BAxUS, to find the global optimum of the objective function within our derived local regions. We evaluate our proposed method on various benchmark synthetic and real-world problems. The results demonstrate that our method outperforms existing state-of-the-art techniques.
Linguistic features for sentence difficulty prediction in ABSA

Authors:
raw_author_name: Chifu, Adrian-Gabriel
raw_author_name: Fournier, Sébastien

Abstract: One of the challenges of natural language understanding is to deal with the subjectivity of sentences, which may express opinions and emotions that add layers of complexity and nuance. Sentiment analysis is a field that aims to extract and analyze these subjective elements from text, and it can be applied at different levels of granularity, such as document, paragraph, sentence, or aspect. Aspect-based sentiment analysis is a well-studied topic with many available data sets and models. However, there is no clear definition of what makes a sentence difficult for aspect-based sentiment analysis. In this paper, we explore this question by conducting an experiment with three data sets: "Laptops", "Restaurants", and "MTSC" (Multi-Target-dependent Sentiment Classification), and a merged version of these three datasets. We study the impact of domain diversity and syntactic diversity on difficulty. We use a combination of classifiers to identify the most difficult sentences and analyze their characteristics. We employ two ways of defining sentence difficulty. The first one is binary and labels a sentence as difficult if the classifiers fail to correctly predict the sentiment polarity. The second one is a six-level scale based on how many of the top five best-performing classifiers can correctly predict the sentiment polarity. We also define 9 linguistic features that, combined, aim at estimating the difficulty at sentence level.
Aligner: Achieving Efficient Alignment through Weak-to-Strong Correction

Authors:
raw_author_name: Ji, Jiaming
raw_author_name: Chen, Boyuan
raw_author_name: Dai, Juntao
raw_author_name: Yang, Yaodong

Abstract: Efforts to align Large Language Models (LLMs) are mainly conducted via Reinforcement Learning from Human Feedback (RLHF) methods. However, RLHF encounters major challenges including training reward models, actor-critic engineering, and importantly, it requires access to LLM parameters. Here we introduce Aligner, a new efficient alignment paradigm that bypasses the whole RLHF process by learning the correctional residuals between the aligned and the unaligned answers. Our Aligner offers several key advantages. Firstly, it is an autoregressive seq2seq model that is trained on the query-answer-correction dataset via supervised learning; this offers a parameter-efficient alignment solution with minimal resources. Secondly, the Aligner facilitates weak-to-strong generalization; finetuning large pretrained models by Aligner's supervisory signals demonstrates strong performance boost. Thirdly, Aligner functions as a model-agnostic plug-and-play module, allowing for its direct application on different open-source and API-based models. Remarkably, Aligner-7B improves 11 different LLMs by 21.9% in helpfulness and 23.8% in harmlessness on average (GPT-4 by 17.5% and 26.9%). When finetuning (strong) Llama2-70B with (weak) Aligner-13B's supervision, we can improve Llama2 by 8.2% in helpfulness and 61.6% in harmlessness. See our dataset and code at https://aligner2024.github.io
TensoSDF: Roughness-aware Tensorial Representation for Robust Geometry  and Material Reconstruction

Authors:
raw_author_name: Li, Jia
raw_author_name: Zhang, Lei
raw_author_name: Wang, Beibei

Abstract: Reconstructing objects with realistic materials from multi-view images is problematic, since it is highly ill-posed. Although the neural reconstruction approaches have exhibited impressive reconstruction ability, they are designed for objects with specific materials (e.g., diffuse or specular materials). To this end, we propose a novel framework for robust geometry and material reconstruction, where the geometry is expressed with the implicit signed distance field (SDF) encoded by a tensorial representation, namely TensoSDF. At the core of our method is the roughness-aware incorporation of the radiance and reflectance fields, which enables a robust reconstruction of objects with arbitrary reflective materials. Furthermore, the tensorial representation enhances geometry details in the reconstructed surface and reduces the training time. Finally, we estimate the materials using an explicit mesh for efficient intersection computation and an implicit SDF for accurate representation. Consequently, our method can achieve more robust geometry reconstruction, outperform the previous works in terms of relighting quality, and reduce 50% training times and 70% inference time.
A Survey on Effective Invocation Methods of Massive LLM Services

Authors:
raw_author_name: Kang, Jiabao

Abstract: Language models as a service (LMaaS) enable users to accomplish tasks without requiring specialized knowledge, simply by paying a service provider. However, numerous providers offer massive large language model (LLM) services with variations in latency, performance, and pricing. Consequently, constructing the cost-saving LLM services invocation strategy with low-latency and high-performance responses that meet specific task demands becomes a pressing challenge. This paper provides a comprehensive overview of the LLM services invocation methods. Technically, we give a formal definition of the problem of constructing effective invocation strategy in LMaaS and present the LLM services invocation framework. The framework classifies existing methods into four different components, including input abstract, semantic cache, solution design, and output enhancement, which can be freely combined with each other. Finally, we emphasize the open challenges that have not yet been well addressed in this task and shed light on future research.
Modified K-means with Cluster Assignment -- Application to COVID-19 Data

Authors:
raw_author_name: Rawat, Shreyash
raw_author_name: Vijayarajan, V.
raw_author_name: Prasath, V. B. Surya

Abstract: Text extraction is a highly subjective problem which depends on the dataset that one is working on and the kind of summarization details that needs to be extracted out. All the steps ranging from preprocessing of the data, to the choice of an optimal model for predictions, depends on the problem and the corpus at hand. In this paper, we describe a text extraction model where the aim is to extract word specified information relating to the semantics such that we can get all related and meaningful information about that word in a succinct format. This model can obtain meaningful results and can augment ubiquitous search model or a normal clustering or topic modelling algorithms. By utilizing new technique called two cluster assignment technique with K-means model, we improved the ontology of the retrieved text. We further apply the vector average damping technique for flexible movement of clusters. Our experimental results on a recent corpus of Covid-19 shows that we obtain good results based on main keywords.
One-shot Neural Face Reenactment via Finding Directions in GAN's Latent  Space

Authors:
raw_author_name: Bounareli, Stella
raw_author_name: Tzelepis, Christos
raw_author_name: Argyriou, Vasileios
raw_author_name: Patras, Ioannis
raw_author_name: Tzimiropoulos, Georgios

Abstract: In this paper, we present our framework for neural face/head reenactment whose goal is to transfer the 3D head orientation and expression of a target face to a source face. Previous methods focus on learning embedding networks for identity and head pose/expression disentanglement which proves to be a rather hard task, degrading the quality of the generated images. We take a different approach, bypassing the training of such networks, by using (fine-tuned) pre-trained GANs which have been shown capable of producing high-quality facial images. Because GANs are characterized by weak controllability, the core of our approach is a method to discover which directions in latent GAN space are responsible for controlling head pose and expression variations. We present a simple pipeline to learn such directions with the aid of a 3D shape model which, by construction, inherently captures disentangled directions for head pose, identity, and expression. Moreover, we show that by embedding real images in the GAN latent space, our method can be successfully used for the reenactment of real-world faces. Our method features several favorable properties including using a single source image (one-shot) and enabling cross-person reenactment. Extensive qualitative and quantitative results show that our approach typically produces reenacted faces of notably higher quality than those produced by state-of-the-art methods for the standard benchmarks of VoxCeleb1 & 2.