Miracle-dz/UniFAR-FTUs huggingface dataset:
Medical therapy for glaucoma: A review

A number of pharmacological targets are exploited to modify the parameters in the Goldmann equation and reduce the intraocular pressure (IOP). This strategy constitutes the foundation for the medical management of glaucoma, the evolution of which, until only recently, has been in relative stagnation. A burst of innovation has produced new ocular hypotensive drugs and long‐acting delivery methods, including intracameral delivery, which are expanding the clinician's medical armamentarium. A number of IOP‐independent neuroprotection strategies have shown strong potential in animal models of glaucoma, but translational attempts have been surprisingly limited. However, while pharmacological options are expanding, the traditional role of topical medical therapy is being challenged by selective laser trabeculoplasty, micro‐invasive glaucoma surgery, and sustained delivery methods. A scientifically rigorous assessment of new treatments will be critical to empower clinicians with evidence‐based information to optimise vision preservation and quality of life outcomes for their patients.
Association between total prostate‐specific antigen (tPSA), free/tPSA, and prostate cancer mortality

First, we should observe that tPSA and fPSA concentrations and their ratios have been measured by niche immunoassays restricted to few research centres: Hybritech Tandem-R (Beckman-Coulter) and Prostatus (Wallac), both calibrated against Hybritech International Standard (IS) [1,2]. The current generation of PSA immunoassays is re-calibrated to the WHO IS 96/670 resulting in ~20–25% lower PSA values and, accordingly, we expect an underestimation of the PSA-based risk of PCa death [3]. Furthermore considering that after the re-calibration to the WHO IS the inter-method bias has shifted from >22% to ~11%, we argue that the predictive ability of the suggested PSA thresholds to discontinue PSA-based screening, strictly depends on the methodology (i.e. although the antibodies may be those of current Beckman assay) and on the calibration used [3].
PointAttN: You Only Need Attention for Point Cloud Completion

Point cloud completion referring to completing 3D shapes from partial 3D point clouds is a fundamental problem for 3D point cloud analysis tasks. Benefiting from the development of deep neural networks, researches on point cloud completion have made great progress in recent years. However, the explicit local region partition like kNNs involved in existing methods makes them sensitive to the density distribution of point clouds. Moreover, it serves limited receptive fields that prevent capturing features from long-range context information. To solve the problems, we leverage the cross-attention and self-attention mechanisms to design novel neural network for point cloud completion with implicit local region partition. Two basic units Geometric Details Perception (GDP) and Self-Feature Augment (SFA) are proposed to establish the structural relationships directly among points in a simple yet effective way via attention mechanism. Then based on GDP and SFA, we construct a new framework with popular encoder-decoder architecture for point cloud completion. The proposed framework, namely PointAttN, is simple, neat and effective, which can precisely capture the structural information of 3D shapes and predict complete point clouds with detailed geometry. Experimental results demonstrate that our PointAttN outperforms state-of-the-art methods on multiple challenging benchmarks. Code is available at: https://github.com/ohhhyeahhh/PointAttN
Differentiable DAG Sampling

We propose a new differentiable probabilistic model over DAGs (DP-DAG). DP-DAG allows fast and differentiable DAG sampling suited to continuous optimization. To this end, DP-DAG samples a DAG by successively (1) sampling a linear ordering of the node and (2) sampling edges consistent with the sampled linear ordering. We further propose VI-DP-DAG, a new method for DAG learning from observational data which combines DP-DAG with variational inference. Hence,VI-DP-DAG approximates the posterior probability over DAG edges given the observed data. VI-DP-DAG is guaranteed to output a valid DAG at any time during training and does not require any complex augmented Lagrangian optimization scheme in contrast to existing differentiable DAG learning approaches. In our extensive experiments, we compare VI-DP-DAG to other differentiable DAG learning baselines on synthetic and real datasets. VI-DP-DAG significantly improves DAG structure and causal mechanism learning while training faster than competitors.
Instance-level loss based multiple-instance learning for acoustic scene classification

In acoustic scene classiﬁcation (ASC) task, an acoustic scene consists of diverse attributes and is inferred by identifying combinations of some distinct attributes among them. This study aims to extract and cluster these attributes effectively using a multiple-instance learning (MIL) framework for ASC. MIL, known as one of the weakly supervised learning methods, is a way to extract instances from input data and infer a scene corresponding to the input data with those unlabeled instances. We develop the MIL framework more suitable for ASC systems, adopting instance-level labels and instance-level loss, which are effective in extracting and clustering instances. As a result, the witness rate increases signiﬁcantly compared to the framework without instance-level loss and labels. Also in several MIL-based ASC systems, the classiﬁcation accuracy improves by about 5 to 11% than without instance-level loss. In addition, we designed a fully separated convolutional module which is a low-complexity neural network consisting of pointwise, frequency-sided depthwise, and temporal-sided depthwise convolutional ﬁlters. Considering both complexity and performance, our proposed system is more practical compared to previous systems on the DCASE 2019 challenge task 1-A leader board. We surpassed the third-place model by achieving a performance of 82.3% with only the model complexity of 417K, which is at least 40 times fewer than other systems.
UNet Architectures in Multiplanar Volumetric Segmentation - Validated on Three Knee MRI Cohorts

Background and Objective:TheUnet has become the golden standardmethod for segmentation of 2Dmedical images that any newmethodmust be validated against. However, in recent years, a number of variations to the seminal Unet has been proposed with promising results in the papers introducing them. However, there is no clear consensus if any of these architectures generalize as well and the Unet currently remains the methodological golden standard. The purpose of this study was to evaluate some of the most promising Unet-inspired architectures for the task of 3D segmentation.
A Differentiable Approach to Combinatorial Optimization using Dataless Neural Networks

The success of machine learning solutions for reasoning about discrete structures has brought attention to its adoption within combinatorial optimization algorithms. Such approaches generally rely on supervised learning by leveraging datasets of the combinatorial structures of interest drawn from some distribution of problem instances. Reinforcement learning has also been employed to find such structures. In this paper, we propose a radically different approach in that no data is required for training the neural networks that produce the solution. In particular, we reduce the combinatorial optimization problem to a neural network and employ a dataless training scheme to refine the parameters of the network such that those parameters yield the structure of interest. We consider the combinatorial optimization problems of finding maximum independent sets and maximum cliques in a graph. In principle, since these problems belong to the NP-hard complexity class, our proposed approach can be used to solve any other NP-hard problem. Additionally, we propose a universal graph reduction procedure to handle large scale graphs. The reduction exploits community detection for graph partitioning and is applicable to any graph type and/or density. Experimental evaluation on both synthetic graphs and real-world benchmarks demonstrates that our method performs on par with or outperforms state-of-the-art heuristic, reinforcement learning, and machine learning based methods without requiring any data.
Fusing Local Similarities for Retrieval-based 3D Orientation Estimation of Unseen Objects

In this paper, we tackle the task of estimating the 3D orientation of previously-unseen objects from monocular images. This task contrasts with the one considered by most existing deep learning methods which typically assume that the testing objects have been observed during training. To handle the unseen objects, we follow a retrieval-based strategy and prevent the network from learning object-specific features by computing multi-scale local similarities between the query image and synthetically-generated reference images. We then introduce an adaptive fusion module that robustly aggregates the local similarities into a global similarity score of pairwise images. Furthermore, we speed up the retrieval process by developing a fast retrieval strategy. Our experiments on the LineMOD, LineMOD-Occluded, and T-LESS datasets show that our method yields a significantly better generalization to unseen objects than previous works. Our code and pre-trained models are available at https://sailor-z.github. io/projects/Unseen_Object_Pose. html.
Can Pre-trained Language Models Interpret Similes as Smart as Human?

Simile interpretation is a crucial task in natural language processing. Nowadays, pre-trained language models (PLMs) have achieved state-of-the-art performance on many tasks. However, it remains under-explored whether PLMs can interpret similes or not. In this paper, we investigate the ability of PLMs in simile interpretation by designing a novel task named Simile Property Probing, i.e., to let the PLMs infer the shared properties of similes. We construct our simile property probing datasets from both general textual corpora and human-designed questions, containing 1,633 examples covering seven main categories. Our empirical study based on the constructed datasets shows that PLMs can infer similes’ shared properties while still underperforming humans. To bridge the gap with human performance, we additionally design a knowledge-enhanced training objective by incorporating the simile knowledge into PLMs via knowledge embedding methods. Our method results in a gain of 8.58% in the probing task and 1.37% in the downstream task of sentiment classification. The datasets and code are publicly available at https://github.com/Abbey4799/PLMs-Interpret-Simile.
Adaptive Noisy Matrix Completion

Low-rank matrix completion has been studied extensively under various type of categories. The problem could be categorized as noisy completion or exact completion, also active or passive completion algorithms. In this paper we focus on adaptive matrix completion with bounded type of noise. We assume that the matrix M we target to recover is composed as low-rank matrix with addition of bounded small noise. The problem has been previously studied by Balcan & Zhang (2016), in a fixed sampling model. Here, we study this problem in adaptive setting that, we continuously estimate an upper bound for the angle with the underlying low-rank subspace and noise-added subspace. Moreover, the method suggested here, could be shown requires much smaller observation than aforementioned method.
MoReL: Multi-omics Relational Learning

Multi-omics data analysis has the potential to discover hidden molecular interactions, revealing potential regulatory and/or signal transduction pathways for cellular processes of interest when studying life and disease systems. One of critical challenges when dealing with real-world multi-omics data is that they may manifest heterogeneous structures and data quality as often existing data may be collected from different subjects under different conditions for each type of omics data. We propose a novel deep Bayesian generative model to efficiently infer a multi-partite graph encoding molecular interactions across such heterogeneous views, using a fused Gromov-Wasserstein (FGW) regularization between latent representations of corresponding views for integrative analysis. With such an optimal transport regularization in the deep Bayesian generative model, it not only allows incorporating view-specific side information, either with graph-structured or unstructured data in different views, but also increases the model flexibility with the distribution-based regularization. This allows efficient alignment of heterogeneous latent variable distributions to derive reliable interaction predictions compared to the existing point-based graph embedding methods. Our experiments on several real-world datasets demonstrate enhanced performance of MoReL in inferring meaningful interactions compared to existing baselines.
Hardware Approximate Techniques for Deep Neural Network Accelerators: A Survey

Deep Neural Networks (DNNs) are very popular because of their high performance in various cognitive tasks in Machine Learning (ML). Recent advancements in DNNs have brought levels beyond human accuracy in many tasks, but at the cost of high computational complexity. To enable efficient execution of DNN inference, more and more research works, therefore, are exploiting the inherent error resilience of DNNs and employing Approximate Computing (AC) principles to address the elevated energy demands of DNN accelerators. This article provides a comprehensive survey and analysis of hardware approximation techniques for DNN accelerators. First, we analyze the state of the art, and by identifying approximation families, we cluster the respective works with respect to the approximation type. Next, we analyze the complexity of the performed evaluations (with respect to the dataset and DNN size) to assess the efficiency, potential, and limitations of approximate DNN accelerators. Moreover, a broad discussion is provided regarding error metrics that are more suitable for designing approximate units for DNN accelerators as well as accuracy recovery approaches that are tailored to DNN inference. Finally, we present how Approximate Computing for DNN accelerators can go beyond energy efficiency and address reliability and security issues as well.
Building Domain-Specific Machine Learning Workflows: A Conceptual Framework for the State-of-the-Practice

Domain experts are increasingly employing machine learning to solve their domain-specific problems. This article presents to software engineering researchers the six key challenges that a domain expert faces in addressing their problem with a computational workflow, and the underlying executable implementation. These challenges arise out of our conceptual framework which presents the “route” of transformations that a domain expert may choose to take while developing their solution. To ground our conceptual framework in the state-of-the-practice, this article discusses a selection of available textual and graphical workflow systems and their support for the transformations described in our framework. Example studies from the literature in various domains are also examined to highlight the tools used by the domain experts as well as a classification of the domain-specificity and machine learning usage of their problem, workflow, and implementation. The state-of-the-practice informs our discussion of the six key challenges, where we identify which challenges and transformations are not sufficiently addressed by available tools. We also suggest possible research directions for software engineering researchers to increase the automation of these tools and disseminate best-practice techniques between software engineering and various scientific domains.
Comparing the frequentist and Bayesian periodic signal detection: rates of statistical mistakes and sensitivity to priors

We perform extensive Monte Carlo simulations to systematically compare the frequentist and Bayesian treatments of the Lomb–Scargle periodogram. The goal is to investigate whether the Bayesian period search is advantageous over the frequentist one in terms of the detection efficiency, how much if yes, and how sensitive it is regarding the choice of the priors, in particular in case of a misspecified prior (whenever the adopted prior does not match the actual distribution of physical objects). We find that the Bayesian and frequentist analyses always offer nearly identical detection efficiency in terms of their tradeoff between type-I and type-II mistakes. Bayesian detection may reveal a formal advantage if the frequency prior is nonuniform, but this results in only ∼ 1 per cent extra detected signals. In case if the prior was misspecified (adopting nonuniform one over the actual uniform) this may turn into an opposite advantage of the frequentist analysis. Finally, we revealed that Bayes factor of this task appears rather overconservative if used without a calibration against type-I mistakes (false positives), thereby necessitating such a calibration in practice.
A Multi-parameter Updating Fourier Online Gradient Descent Algorithm for Large-scale Nonlinear Classification

Large scale nonlinear classification is a challenging task in the field of support vector machine. Online random Fourier feature map algorithms are very important methods for dealing with large scale nonlinear classification problems. The main shortcomings of these methods are as follows: (1) Since only the hyperplane vector is updated during learning while the random directions are fixed, there is no guarantee that these online methods can adapt to the change of data distribution when the data is coming one by one. (2) The dimension of the random direction is often higher for obtaining better classification accuracy, which results in longer test time. In order to overcome these shortcomings, a multi-parameter updating Fourier online gradient descent algorithm (MPU-FOGD) is proposed for large-scale nonlinear classification problems based on a novel random feature map. In the proposed method, the suggested random feature map has lower dimension while the multi-parameter updating strategy can guarantee the learning model can better adapt to the change of data distribution when the data is coming one by one. Theoretically, it is proved that compared with the existing random Fourier feature maps, the proposed random feature map can give a tighter error bound. Empirical studies on several benchmark data sets demonstrate that compared with the state-of-the-art online random Fourier feature map methods, the proposed MPU-FOGD can obtain better test accuracy.
On-The-Go Robot-to-Human Handovers with a Mobile Manipulator

Existing approaches to direct robot-to-human handovers are typically implemented on fixed-base robot arms, or on mobile manipulators that come to a full stop before performing the handover. We propose "on-the-go" handovers which permit a moving mobile manipulator to hand over an object to a human without stopping. The on-the-go handover motion is generated with a reactive controller that allows simultaneous control of the base and the arm. In a user study, human receivers subjectively assessed on-the-go handovers to be more efficient, predictable, natural, better timed and safer than handovers that implemented a "stop-and-deliver" behavior.
Free outer functions in complete Pick spaces

Jury and Martin establish an analogue of the classical inner-outer factorization of Hardy space functions. They show that every function f in a Hilbert function space with a normalized complete Pick reproducing kernel has a factorization of the type f = φg, where g is cyclic, φ is a contractive multiplier, and ‖f‖ = ‖g‖. In this paper we show that if the cyclic factor is assumed to be what we call free outer, then the factors are essentially unique, and we give a characterization of the factors that is intrinsic to the space. That lets us compute examples. We also provide several applications of this factorization.
Hyperdecoders: Instance-specific decoders for multi-task NLP

We investigate input-conditioned hypernetworks for multi-tasking in NLP, generating parameter-efficient adaptations for a decoder using a hypernetwork conditioned on the output of an encoder. This approach produces a unique decoder adaptation for every input instance, allowing the network a larger degree of flexibility than prior work that only produces one decoder adaptation per task. We apply our method to sequence classification tasks, extractive QA, and summarisation and find that it surpasses previous parameter efficient fine-tuning methods and often outperforms fully finetuning the underlying model. An analysis of the embeddings used by our hypernetwork shows that they are sensitive to output label and type, suggesting that our approach better maps from encoder representations to output labels. Our code is publicly available at https://github.com/allenai/hyperdecoders.
Chaotic dynamics of the mass deformed ABJM model

We explore the chaotic dynamics of the mass-deformed Aharony-Bergman-Jafferis-Maldacena model. To do so, we first perform a dimensional reduction of this model from $2+1$ to $0+1$ dimensions, considering that the fields are spatially uniform. Working in the 't Hooft limit and tracing over ansatz configurations involving fuzzy 2-spheres, which are described in terms of the Gomis-Rodriguez-Gomez-Van Raamsdonk-Verlinde matrices with collective time dependence, we obtain a family of reduced effective Lagrangians and demonstrate that they have chaotic dynamics by computing the associated Lyapunov exponents. In particular, we focus on how the largest Lyapunov exponent, $\lambda_L$, changes as a function of $E/N^2$. Depending on the structure of the effective potentials, we find either $\lambda_L \propto (E/N^2)^{1/3}$ or $\lambda_L \propto (E/N^2 - \gamma_N)^{1/3}$, where $\gamma_N(k, \mu)$ are constants determined in terms of the Chern-Simons coupling $k$, the mass $\mu$, and the matrix level $N$. Noting that the classical dynamics approximates the quantum theory only in the high-temperature regime, we investigate the temperature dependence of the largest Lyapunov exponents and give upper bounds on the temperature above which $\lambda_L$ values comply with the Maldacena-Shenker-Stanford bound, $ \lambda_L \leq 2 \pi T $, and below which it will eventually be not obeyed.
Bayesian analysis of Formula One race results: disentangling driver skill and constructor advantage

Abstract Successful performance in Formula One is determined by combination of both the driver’s skill and race-car constructor advantage. This makes key performance questions in the sport difficult to answer. For example, who is the best Formula One driver, which is the best constructor, and what is their relative contribution to success? In this paper, we answer these questions based on data from the hybrid era in Formula One (2014–2021 seasons). We present a novel Bayesian multilevel rank-ordered logit regression method to model individual race finishing positions. We show that our modelling approach describes our data well, which allows for precise inferences about driver skill and constructor advantage. We conclude that Hamilton and Verstappen are the best drivers in the hybrid era, the top-three teams (Mercedes, Ferrari, and Red Bull) clearly outperform other constructors, and approximately 88 % of the variance in race results is explained by the constructor. We argue that this modelling approach may prove useful for sports beyond Formula One, as it creates performance ratings for independent components contributing to success.