SearcharxivSearch

arXiv subjects

Anna Vlasova

Publications and source records attributed to Anna Vlasova.

6 recordsLinked to original sources

Reputational Conservatism in Expert Advice

We study expert advice with career concerns and continuous private signals. The principal always implements the safe option, and implements the risky option with a probability increasing in the expert's reputation; outcomes, when realized, update reputation. We show a unique cutoff equilibrium and continuity. Under a relative-diagnosticity condition, the experimentation threshold is increasing in reputation ("playing it safe at the top"). Comparative statics are clean, and success-contingent bonuses map one-to-one into experimentation while gatekeeping scales implemented experimentation and learning.

econ.TH

Endogenous Vindication: Reputation and Effort in Expert Advice

An expert's advice is often evaluated only when a client acts, and the quality of that evaluation depends on implementation effort. We study repeated advice by an expert whose fixed ability is unknown to both the expert and the public. A favorable recommendation may induce a short-lived client to undertake a costly project and choose effort. Higher reputation elicits greater effort, making outcomes more informative about ability. The expert therefore controls whether a reputation-dependent performance test occurs, while the client controls its precision. With diminishing career returns to reputation, the expert may withhold favorable advice even when implementation creates positive surplus. Monotone exposure follows from broad smooth primitives when implementation requires sufficiently high reputation, and from an explicit open family of quadratic environments. Advice then follows a reputation cutoff; stronger career concerns weakly raise it and can stop testing earlier. A low-ability expert eventually enters an absorbing distrust region, while a high-ability expert is permanently distrusted with positive probability and otherwise fully vindicated. Individually more informative tests can therefore coexist with less learning overall because reputational incentives reduce the number of tests conducted.

econ.TH

Paying for Failure in Expert Advice

A failed recommendation is visible; an unproposed project is not. How should an organization pay an adviser whose private confidence determines which projects reach the margin? We show that the least-cost instrument is protection after failure rather than a success bonus. Because risky advice selects the upper tail of confidence, success pay leaks to recommendations that would occur anyway, while failure protection is concentrated at the margin. We establish unique nonpooling implementation, show that full correction is never optimal, and, while advice still needs encouragement, find confidential internal review substitutes for explicit career insurance more effectively than transparent review.

econ.TH

Quantum-machine-learning channel discrimination

In the problem of quantum channel discrimination, one distinguishes between a given number of quantum channels, which is done by sending an input state through a channel and measuring the output state. This work studies applications of variational quantum circuits and machine learning techniques for discriminating such channels. In particular, we explore (i) the practical implementation of embedding this task into the framework of variational quantum computing, (ii) training a quantum classifier based on variational quantum circuits, and (iii) applying the quantum kernel estimation technique. For testing these three channel discrimination approaches, we considered a pair of entanglement-breaking channels and the depolarizing channel with two different depolarization factors. For the approach (i), we address solving the quantum channel discrimination problem using widely discussed parallel and sequential strategies. We show the advantage of the latter in terms of better convergence with less quantum resources. Quantum channel discrimination with a variational quantum classifier (ii) allows one to operate even with random and mixed input states and simple variational circuits. The kernel-based classification approach (iii) is also found effective as it allows one to discriminate depolarizing channels associated not with just fixed values of the depolarization factor, but with ranges of it. Additionally, we discovered that a simple modification of one of the commonly used kernels significantly increases the efficiency of this approach. Finally, our numerical findings reveal that the performance of variational methods of channel discrimination depends on the trace of the product of the output states. These findings demonstrate that quantum machine learning can be used to discriminate channels, such as those representing physical noise processes.

quant-ph

Lupa: A Framework for Large Scale Analysis of the Programming Language Usage

In this paper, we present Lupa - a framework for large-scale analysis of the programming language usage. Lupa is a command line tool that uses the power of the IntelliJ Platform under the hood, which gives it access to powerful static analysis tools used in modern IDEs. The tool supports custom analyzers that process the rich concrete syntax tree of the code and can calculate its various features: the presence of entities, their dependencies, definition-usage chains, etc. Currently, Lupa supports analyzing Python and Kotlin, but can be extended to other languages supported by IntelliJ-based IDEs. We explain the internals of the tool, show how it can be extended and customized, and describe an example analysis that we carried out with its help: analyzing the syntax of ranges in Kotlin.

cs.PL

Automatic generation of reviews of scientific papers

With an ever-increasing number of scientific papers published each year, it becomes more difficult for researchers to explore a field that they are not closely familiar with already. This greatly inhibits the potential for cross-disciplinary research. A traditional introduction into an area may come in the form of a review paper. However, not all areas and sub-areas have a current review. In this paper, we present a method for the automatic generation of a review paper corresponding to a user-defined query. This method consists of two main parts. The first part identifies key papers in the area by their bibliometric parameters, such as a graph of co-citations. The second stage uses a BERT based architecture that we train on existing reviews for extractive summarization of these key papers. We describe the general pipeline of our method and some implementation details and present both automatic and expert evaluations on the PubMed dataset.

cs.LG