Miracle-dz/UniFAR-FTUs huggingface dataset:
mL-BFGS: A Momentum-based L-BFGS for Distributed Large-Scale Neural Network Optimization

Quasi-Newton methods still face significant challenges in training large-scale neural networks due to additional compute costs in the Hessian related computations and instability issues in stochastic training. A well-known method, L-BFGS that efficiently approximates the Hessian using history parameter and gradient changes, suffers convergence instability in stochastic training. So far, attempts that adapt L-BFGS to large-scale stochastic training incur considerable extra overhead, which offsets its convergence benefits in wall-clock time. In this paper, we propose mL-BFGS, a lightweight momentum-based L-BFGS algorithm that paves the way for quasi-Newton (QN) methods in large-scale distributed deep neural network (DNN) optimization. mL-BFGS introduces a nearly cost-free momentum scheme into L-BFGS update and greatly reduces stochastic noise in the Hessian, therefore stabilizing convergence during stochastic optimization. For model training at a large scale, mL-BFGS approximates a block-wise Hessian, thus enabling distributing compute and memory costs across all computing nodes. We provide a supporting convergence analysis for mL-BFGS in stochastic settings. To investigate mL-BFGS potential in large-scale DNN training, we train benchmark neural models using mL-BFGS and compare performance with baselines (SGD, Adam, and other quasi-Newton methods). Results show that mL-BFGS achieves both noticeable iteration-wise and wall-clock speedup.
Waypoint-Based Imitation Learning for Robotic Manipulation

While imitation learning methods have seen a resurgent interest for robotic manipulation, the well-known problem of compounding errors continues to afflict behavioral cloning (BC). Waypoints can help address this problem by reducing the horizon of the learning problem for BC, and thus, the errors compounded over time. However, waypoint labeling is underspecified, and requires additional human supervision. Can we generate waypoints automatically without any additional human supervision? Our key insight is that if a trajectory segment can be approximated by linear motion, the endpoints can be used as waypoints. We propose Automatic Waypoint Extraction (AWE) for imitation learning, a preprocessing module to decompose a demonstration into a minimal set of waypoints which when interpolated linearly can approximate the trajectory up to a specified error threshold. AWE can be combined with any BC algorithm, and we find that AWE can increase the success rate of state-of-the-art algorithms by up to 25% in simulation and by 4-28% on real-world bimanual manipulation tasks, reducing the decision making horizon by up to a factor of 10. Videos and code are available at https://lucys0.github. io/awe/
Leveraging Implicit Feedback from Deployment Data in Dialogue

We study improving social conversational agents by learning from natural dialogue between users and a deployed model, without extra annotations. To implicitly measure the quality of a machine-generated utterance, we leverage signals like user response length, sentiment and reaction of the future human utterances in the collected dialogue episodes. Our experiments use the publicly released deployment data from BlenderBot (Xu et al., 2023). Human evaluation indicates improvements in our new models over baseline responses; however, we find that some proxy signals can lead to more generations with undesirable properties as well. For example, optimizing for conversation length can lead to more controversial or unfriendly generations compared to the baseline, whereas optimizing for positive sentiment or reaction can decrease these behaviors.
Capital Structure Theories and its Practice, A study with reference to select NSE listed public sectors banks, India

Among the various factors affecting the firms positioning and performance in modern day markets, capital structure of the firm has its own way of expressing itself as a crucial one. With the rapid changes in technology, firms are being pushed onto a paradigm that is burdening the capital management process. Hence the study of capital structure changes gives the investors an insight into firm's behavior and intrinsic goals. These changes will vary for firms in different sectors. This work considers the banking sector, which has a unique capital structure for the given regulations of its operations in India. The capital structure behavioral changes in a few public sector banks are studied in this paper. A theoretical framework has been developed from the popular capital structure theories and hypotheses are derived from them accordingly. The main idea is to validate different theories with real time performance of the select banks from 2011 to 2022. Using statistical techniques like regression and correlation, tested hypotheses have resulted in establishing the relation between debt component and financial performance variables of the select banks which are helping in understanding the theories in practice.
Under-Approximation Reﬁnement for Classical Planning

A general and important problem of search-based planning techniques is the state explosion problem, which is usually tackled with approaches to reduce the branching factor of the planning task. Such approaches often implicitly exploit the observation that the number of available operators is higher than the number of operators that are actually needed to find a plan. In this paper, we propose a simple, but general under-approximation refinement framework for satisficing planning that explicitly exploits this observation. Our approach iteratively searches for plans with operator subsets, which are refined if necessary by adding operators that appear to be needed. Our evaluation shows that even a straight-forward instantiation of this framework yields a competitive planner that often finds plans with small operator sets.
Learning to Design Analog Circuits to Meet Threshold Specifications

Automated design of analog and radio-frequency circuits using supervised or reinforcement learning from simulation data has recently been studied as an alternative to manual expert design. It is straightforward for a design agent to learn an inverse function from desired performance metrics to circuit parameters. However, it is more common for a user to have threshold performance criteria rather than an exact target vector of feasible performance measures. In this work, we propose a method for generating from simulation data a dataset on which a system can be trained via supervised learning to design circuits to meet threshold specifications. We moreover perform the to-date most extensive evaluation of automated analog circuit design, including experimenting in a significantly more diverse set of circuits than in prior work, covering linear, nonlinear, and autonomous circuit configurations, and show that our method consistently reaches success rate better than 90% at 5% error margin, while also improving data efficiency by upward of an order of magnitude. A demo of this system is available at circuits.streamlit. app
EC: A Tool for Guiding Chart and Caption Emphasis

Recent work has shown that when both the chart and caption emphasize the same aspects of the data, readers tend to remember the doubly-emphasized features as takeaways; when there is a mismatch, readers rely on the chart to form takeaways and can miss information in the caption text. Through a survey of 280 chart-caption pairs in real-world sources (e.g., news media, poll reports, government reports, academic articles, and Tableau Public), we find that captions often do not emphasize the same information in practice, which could limit how effectively readers take away the authors' intended messages. Motivated by the survey findings, we present Emphasischecker, an interactive tool that highlights visually prominent chart features as well as the features emphasized by the caption text along with any mismatches in the emphasis. The tool implements a time-series prominent feature detector based on the Ramer-Douglas-Peucker algorithm and a text reference extractor that identifies time references and data descriptions in the caption and matches them with chart data. This information enables authors to compare features emphasized by these two modalities, quickly see mismatches, and make necessary revisions. A user study confirms that our tool is both useful and easy to use when authoring charts and captions.
Hybrid Representation-Enhanced Sampling for Bayesian Active Learning in Musculoskeletal Segmentation of Lower Extremities

PURPOSE Manual annotations for training deep learning models in auto-segmentation are time-intensive. This study introduces a hybrid representation-enhanced sampling strategy that integrates both density and diversity criteria within an uncertainty-based Bayesian active learning (BAL) framework to reduce annotation efforts by selecting the most informative training samples. METHODS The experiments are performed on two lower extremity datasets of MRI and CT images, focusing on the segmentation of the femur, pelvis, sacrum, quadriceps femoris, hamstrings, adductors, sartorius, and iliopsoas, utilizing a U-net-based BAL framework. Our method selects uncertain samples with high density and diversity for manual revision, optimizing for maximal similarity to unlabeled instances and minimal similarity to existing training data. We assess the accuracy and efficiency using dice and a proposed metric called reduced annotation cost (RAC), respectively. We further evaluate the impact of various acquisition rules on BAL performance and design an ablation study for effectiveness estimation. RESULTS In MRI and CT datasets, our method was superior or comparable to existing ones, achieving a 0.8% dice and 1.0% RAC increase in CT (statistically significant), and a 0.8% dice and 1.1% RAC increase in MRI (not statistically significant) in volume-wise acquisition. Our ablation study indicates that combining density and diversity criteria enhances the efficiency of BAL in musculoskeletal segmentation compared to using either criterion alone. CONCLUSION Our sampling method is proven efficient in reducing annotation costs in image segmentation tasks. The combination of the proposed method and our BAL framework provides a semi-automatic way for efficient annotation of medical image datasets.
Distributed Computing of Functions of Structured Sources with Helper Side Information

In this work, we consider the problem of distributed computing of functions of structured sources, focusing on the classical setting of two correlated sources and one user that seeks the outcome of the function while benefiting from low-rate side information provided by a helper node. Focusing on the case where the sources are jointly distributed according to a very general mixture model, we here provide an achievable coding scheme that manages to substantially reduce the communication cost of distributed computing by exploiting the nature of the joint distribution of the sources, the side information, as well as by exploiting the symmetry enjoyed by the desired functions. Our scheme — which can readily apply in a variety of real-life scenarios including learning, combinatorics, and graph neural network applications — is here shown to provide substantial reductions in the communication costs, while simultaneously providing computational savings by reducing the exponential complexity of joint decoding techniques to a complexity that is merely linear.
LiDAR-based drone navigation with reinforcement learning

Reinforcement learning is of increasing importance in the field of robot control and simulation plays a~key role in this process. In the unmanned aerial vehicles (UAVs, drones), there is also an increase in the number of published scientific papers involving this approach. In this work, an autonomous drone control system was prepared to fly forward (according to its coordinates system) and pass the trees encountered in the forest based on the data from a rotating LiDAR sensor. The Proximal Policy Optimization (PPO) algorithm, an example of reinforcement learning (RL), was used to prepare it. A custom simulator in the Python language was developed for this purpose. The Gazebo environment, integrated with the Robot Operating System (ROS), was also used to test the resulting control algorithm. Finally, the prepared solution was implemented in the Nvidia Jetson Nano eGPU and verified in the real tests scenarios. During them, the drone successfully completed the set task and was able to repeatably avoid trees and fly through the forest.
Open Image Content Disarm And Reconstruction

With the advance in malware technology, attackers create new ways to hide their malicious code from antivirus services. One way to obfuscate an attack is to use common files as cover to hide the malicious scripts, so the malware will look like a legitimate file. Although cutting-edge Artificial Intelligence and content signature exist, evasive malware successfully bypasses next-generation malware detection using advanced methods like steganography. Some of the files commonly used to hide malware are image files (e.g., JPEG). In addition, some malware use steganography to hide malicious scripts or sensitive data in images. Steganography in images is difficult to detect even with specialized tools. Image-based attacks try to attack the user's device using malicious payloads or utilize image steganography to hide sensitive data inside legitimate images and leak it outside the user's device. Therefore in this paper, we present a novel Image Content Disarm and Reconstruction (ICDR). Our ICDR system removes potential malware, with a zero trust approach, while maintaining high image quality and file usability. By extracting the image data, removing it from the rest of the file, and manipulating the image pixels, it is possible to disable or remove the hidden malware inside the file.
Neighbourhood Design by Consistency Checking

We present a general approach for solving Constraint Optimization Problems. We design a Consistent Neighbourhood which, after each variable assignment, deletes conflicting variables to maintain the constraint consistency. Instead of allowing infeasible moves on complete configurations, we work only on partial consistent ones until a solution is found. This approach is applied in solving real-life problems.
Bipartite Consensus Control of High-Order Multiagent Systems With Unknown Disturbances

In this paper, a bipartite consensus problem is considered for a high-order multiagent system with unknown disturbances and cooperative-competitive interactions. Two control strategies are proposed to guarantee bipartite consensus for two cases with and without an exogenous system (called leader for simplicity), respectively. Linearly parameterized approaches are applied to describe the time-varying unknown disturbances. Distributed adaptive laws are then designed for the unknown parameters in the disturbances. Adaptive consensus controllers are designed in a fully distributed fashion, which does not rely on any global information. Simulation results are presented to demonstrate the formation of bipartite consensus under the proposed adaptive control strategies.
Beyond the Edge of Stability via Two-step Gradient Updates

Gradient Descent (GD) is a powerful workhorse of modern machine learning thanks to its scalability and efficiency in high-dimensional spaces. Its ability to find local minimisers is only guaranteed for losses with Lipschitz gradients, where it can be seen as a `bona-fide' discretisation of an underlying gradient flow. Yet, many ML setups involving overparametrised models do not fall into this problem class, which has motivated research beyond the so-called ``Edge of Stability'' (EoS), where the step-size crosses the admissibility threshold inversely proportional to the Lipschitz constant above. Perhaps surprisingly, GD has been empirically observed to still converge regardless of local instability and oscillatory behavior. The incipient theoretical analysis of this phenomena has mainly focused in the overparametrised regime, where the effect of choosing a large learning rate may be associated to a `Sharpness-Minimisation' implicit regularisation within the manifold of minimisers, under appropriate asymptotic limits. In contrast, in this work we directly examine the conditions for such unstable convergence, focusing on simple, yet representative, learning problems, via analysis of two-step gradient updates. Specifically, we characterize a local condition involving third-order derivatives that guarantees existence and convergence to fixed points of the two-step updates, and leverage such property in a teacher-student setting, under population loss. Finally, starting from Matrix Factorization, we provide observations of period-2 orbit of GD in high-dimensional settings with intuition of its dynamics, along with exploration into more general settings.
End-to-End Learning of Deep Visuomotor Policy for Needle Picking

Needle picking is a challenging manipulation task in robot-assisted surgery due to the characteristics of small slender shapes of needles, needles' variations in shapes and sizes, and demands for millimeter-level control. Prior works, heavily relying on the prior of needles (e.g., geometric models), are hard to scale to unseen needles' variations. In this paper, we present the first end- to-end learning method to train deep visuomotor policy for needle picking. Concretely, we propose DreamerfD to maximally leverage demonstrations to improve the learning efficiency of a state-of-the-art model-based reinforcement learning method, DreamerV2; Since Variational Auto-Encoder (VAE) in DreamerV2 is difficult to scale to high-resolution images, we propose Dynamic Spotlight Adaptation to represent control-related visual signals in a low-resolution image space; Virtual Clutch is also proposed to reduce per-formance degradation due to significant error between prior and posterior encoded states at the beginning of a rollout. We conducted extensive experiments in simulation to evaluate the performance, robustness, in-domain variation adaptation, and effectiveness of individual components of our method. Our method, trained by 8k demonstration timesteps and 140k online policy timesteps, can achieve a remarkable success rate of 80%. Furthermore, our method effectively demonstrated its superiority in generalization to unseen in-domain variations including needle variations and image disturbance, highlighting its robustness and versatility. Codes and videos are available at https://sites.google. com/view/DreamerfD.
Prompt Generate Train (PGT): Few-shot Domain Adaption of Retrieval Augmented Generation Models for Open Book Question-Answering

We propose a framework - Prompt, Generate, Train (PGT) - to efficiently develop a generative question-answering model for open-book question-answering over a proprietary collection of text documents. The framework adapts a retriever augmented generation (RAG) model to the target domain using supervised fine-tuning and reinforcement learning with synthetic feedback in a few-shot setting. This, we hypothesize, will yield an aligned, uncertainty calibrated model that is competitive with GPT-4 based in-context retrieval augmented generation in generating relevant answers at lower serving costs. The framework's synthetic generation pipeline will generate synthetic training data comprisingtuples using an open-source LLM and a novel consistency filtering scheme. The pipeline will be designed to generate both abstractive and extractive questions that span the entire corpus. The framework proposes to fine-tune a smaller RAG model comprising a dense retriever (ColBERTv2) and a smaller sized LLM on the synthetic dataset. In parallel, the framework will train a Reward model to score domain grounded answers higher than hallucinated answers using an a priori relevance ordering of synthetically assembled samples. In the next phase, the framework will align the RAG model with the target domain using reinforcement learning (Proximal Policy Optimization). This step may improve the RAG model's ability to generate grounded answers and ignore out of domain questions. In the final phase, the framework will calibrate the model's uncertainty for extractive question-answers.
Gabriel G. Bès, linguiste empiriste [Gabriel G. Bès, an empiricist linguist]

This article presents the work of Gabriel G. Bès, with extends from the 60s to the 2000s, from structuralism to industrial language analysis. The work of Gabriel G. Bès is marked throughout by the epistemological question and the will to put into practice linguistics as an empirical science. The central problems are the explicitation of the observations of reality, the formalisation of hypotheses, and the rigorous testing of the adequation of hypotheses with respect to observations. MOTS-CLÉS : épistémologie de la linguistique, empirisme, formalisation, traitement automatique des langues, histoire de la linguistique.
Poloidal impurity asymmetries, flow and neoclassical transport in pedestals in the plateau and banana regimes

Charge exchange recombination spectroscopy (CXRS) measures the radial electric field in the pedestal by measuring the impurity density, temperature and flow. Combined outboard and inboard CXRS measurements allow poloidal variations that arise due to the poloidal variation of the magnetic field to be determined. At present, impurity neoclassical pedestal models avoid the complications of treating finite poloidal gyroradius effects by assuming the impurity charge number is large compared with the main ion charge number. These models are extended slightly by retaining the impurity radial pressure gradient to demonstrate that no substantial effect occurs due to impurity diamagnetic effects. More importantly, the neoclassical model is significantly extended to obtain a more comprehensive treatment of the main ions in the plateau and banana regimes. A parallel impurity momentum equation is derived that is consistent with previous results in the banana regime and reduces to the proper large aspect ratio form required in the plateau regime. The implications for interpreting the CXRS measurements are discussed by writing all results in terms of the gradient drive and poloidal flow.
Acute Metabolic Effects of Clonidine and Adenosine in Man

Summary Insulin resistance may contribute to non-in sulin-dependent diabetes mellitus, hypertension, and dyslipidemia; increased free fatty acid concentrations could both promote and maintain this state of insulin resistance. There fore, agents that inhibit lipolysis and decrease plasma con centrations of free fatty acids could be of therapeutic inter est. We have measured metabolic effects of clonidine, an alpha2 adrenergic agonist, and adenosine in healthy human subjects since human fat cells have alpha2 and adenosine Al receptors, which inhibit lipolysis in vitro. Clonidine, as expected,
Regulation by Insulin of Cyclic Nucleotide Phosphodiesterase (PDE) from Rat Luteal Cells

Summary The effect of insulin on cyclic nucleotide phosphodiesterase (PDE) in rat luteal cells was studied. Cells were obtained from PMSG/hCG primed rats and further incubated or not with insulin. The hormone produced an increase of enzyme activity after a 10 min incubation of intact cells. Maximal stimulation was achieved at 0.2 nM of insulin. Two peaks of cyclic nucleotide phosphodiesterase activity were resolved after chromatography of cell cytosolic extracts on DEAE-cellulose. These peaks (I and II) were active with cAMP as substrate but only peak I was active with cGMP. The enzyme activity of both peaks was increased in cells treated with in sulin. Phosphodiesterase activity in the two peaks show two kinetic components for cAMP hydrolysis, one of high affinity (Km 2-4 uM) and the other of low affinity (47-56 MM). Treat ment of the cells with insulin produced a 2 to 8 fold increase of the Vmax of these peaks. In addition after stimulation with insulin, the activation of peak I phosphodiesterase by calmodulin was less effective.