Related papers: Revisiting virtual difference ideals
We consider a multi-dimensional screening problem of selling a product with multiple quality levels and design virtual value functions to derive conditions that imply optimality of only selling highest quality. A challenge of designing…
Learning models that are robust to distribution shifts is a key concern in the context of their real-life applicability. Invariant Risk Minimization (IRM) is a popular framework that aims to learn robust models from multiple environments.…
A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are…
In the present paper, we describe new approaches for constructing virtual knot invariants. The main background of this paper comes from formulating and bringing together the ideas of biquandle (Kauffman and Radford) the virtual quandle…
We propose a novel approach to distinguish table vs non-table ideals by using different machine learning algorithms. We introduce the reader to table ideals, assuming some knowledge on commutative algebra and describe their main properties.…
Inverse reinforcement learning (IRL) aims to recover the reward function of an expert agent from demonstrations of behavior. It is well-known that the IRL problem is fundamentally ill-posed, i.e., many reward functions can explain the…
Identifying latent representations or causal structures is important for good generalization and downstream task performance. However, both fields have been developed rather independently. We observe that several methods in both…
In this article we develop a duality principle suitable for a large class of problems in optimization. The main result is obtained through basic tools of convex analysis and duality theory. We establish a correct relation between the…
Inverse Reinforcement Learning (IRL) -- the problem of learning reward functions from demonstrations of an \emph{expert policy} -- plays a critical role in developing intelligent systems. While widely used in applications, theoretical…
We consider the set of all the ideals of a ring, endowed with the coarse lower topology. The aim of this paper is to study the topological properties of distinguished subspaces of this space and detect the spectrality of some of them.
In this article we are examining extensions and some basic diagrammatic properties of modules, in both cases from a new, "virtual" point of view. As natural background for investigating the kind of problems we are dealing with, the virtual…
Collecting training data from the physical world is usually time-consuming and even dangerous for fragile robots, and thus, recent advances in robot learning advocate the use of simulators as the training platform. Unfortunately, the…
There has arisen in recent years a substantial theory of "multiplier ideals'' in commutative rings. These are integrally closed ideals with properties that lend themselves to highly interesting applications. But how special are they among…
Building on insights of Jovanovic (1982) and subsequent authors, we develop a comprehensive theory of optimal timing of decisions based around continuation value functions and operators that act on them. Optimality results are provided…
Given a finite set of arbitrarily distributed points in affine space with arbitrary multiplicity structures, we present an algorithm to compute the reduced Groebner basis of the vanishing ideal under the lexicographic ordering. Our method…
For obtaining causal inferences that are objective, and therefore have the best chance of revealing scientific truths, carefully designed and executed randomized experiments are generally considered to be the gold standard. Observational…
We sharpen the construction of representation space in the paper "Principal Series Representations of Infinite Dimensional Lie Groups II: Construction of Induced Representations". We show that the principal series representation spaces…
We analyse the family of $C^1$-Virtual Elements introduced in \cite{Brezzi:Marini:plates} for fourth-order problems and prove optimal estimates in $L^2$ and in $H^1$ via classical duality arguments.
The ``impossibility theorem'' -- which is considered foundational in algorithmic fairness literature -- asserts that there must be trade-offs between common notions of fairness and performance when fitting statistical models, except in two…
It is difficult to extract reliable criteria for causal locality from the limited ingredients found in textbook quantum theory. In the end, Bell humbly warned that his eponymous theorem was based on criteria that "should be viewed with the…