Can language models learn analogical reasoning? Investigating training objectives and comparisons to human performance

While analogies are a common way to evaluate word embeddings in NLP, it is also of interest to investigate whether or not analogical reasoning is a task in itself that can be learned. In this paper, we test several ways to learn basic analogical reasoning, specifically focusing on analogies that are more typical of what is used to evaluate analogical reasoning in humans than those in commonly used NLP benchmarks. Our experiments find that models are able to learn analogical reasoning, even with a small amount of data. We additionally compare our models to a dataset with a human baseline, and find that after training, models approach human performance

Sliding mode control of quantum systems

This paper proposes a new robust control method for quantum systems with uncertainties involving sliding mode control (SMC). Sliding mode control is a widely used approach in classical control theory and industrial applications. We show that SMC is also a useful method for robust control of quantum systems. In this paper, we define two specific classes of sliding modes (i.e., eigenstates and state subspaces) and propose two novel methods combining unitary control and periodic projective measurements for the design of quantum sliding mode control systems. Two examples including a two-level system and a three-level system are presented to demonstrate the proposed SMC method. One of main features of the proposed method is that the designed control laws can guarantee desired control performance in the presence of uncertainties in the system Hamiltonian. This sliding mode control approach provides a useful control theoretic tool for robust quantum information processing with uncertainties.Comment: 18 pages, 4 figure

Single-machine scheduling with stepwise tardiness costs and release times

We study a scheduling problem that belongs to the yard operations component of the railroad planning problems, namely the hump sequencing problem. The scheduling problem is characterized as a single-machine problem with stepwise tardiness cost objectives. This is a new scheduling criterion which is also relevant in the context of traditional machine scheduling problems. We produce complexity results that characterize some cases of the problem as pseudo-polynomially solvable. For the difficult-to-solve cases of the problem, we develop mathematical programming formulations, and propose heuristic algorithms. We test the formulations and heuristic algorithms on randomly generated single-machine scheduling problems and real-life datasets for the hump sequencing problem. Our experiments show promising results for both sets of problems

Effect of a Patient-Centered Phone Call by a Clinical Officer at Time of HIV Testing on Linkage to Care in Rural Kenya.

In a randomized controlled trial, we tested whether a structured, patient-centered phone call from a clinical officer after HIV testing improved linkage to/re-engagement in HIV care. Among 130 HIV-positive persons, those randomized to the phone call were significantly more likely to link to care by 7 and 30 days (P = .04)

Estimating Nuisance Parameters in Inverse Problems

Many inverse problems include nuisance parameters which, while not of direct interest, are required to recover primary parameters. Structure present in these problems allows efficient optimization strategies - a well known example is variable projection, where nonlinear least squares problems which are linear in some parameters can be very efficiently optimized. In this paper, we extend the idea of projecting out a subset over the variables to a broad class of maximum likelihood (ML) and maximum a posteriori likelihood (MAP) problems with nuisance parameters, such as variance or degrees of freedom. As a result, we are able to incorporate nuisance parameter estimation into large-scale constrained and unconstrained inverse problem formulations. We apply the approach to a variety of problems, including estimation of unknown variance parameters in the Gaussian model, degree of freedom (d.o.f.) parameter estimation in the context of robust inverse problems, automatic calibration, and optimal experimental design. Using numerical examples, we demonstrate improvement in recovery of primary parameters for several large- scale inverse problems. The proposed approach is compatible with a wide variety of algorithms and formulations, and its implementation requires only minor modifications to existing algorithms.Comment: 16 pages, 5 figure