Recommender Systems meet Mechanism Design
- URL: http://arxiv.org/abs/2110.12558v1
- Date: Mon, 25 Oct 2021 00:03:30 GMT
- Title: Recommender Systems meet Mechanism Design
- Authors: Yang Cai, Constantinos Daskalakis
- Abstract summary: We consider a multi-item mechanism design problem where the bidders' value distributions can be approximated by a topic model.
We provide an extension of the framework that allows us to exploit the expressive power of topic models to reduce the effective dimensionality of the problem.
- Score: 29.132299904090868
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Machine learning has developed a variety of tools for learning and
representing high-dimensional distributions with structure. Recent years have
also seen big advances in designing multi-item mechanisms. Akin to overfitting,
however, these mechanisms can be extremely sensitive to the Bayesian prior that
they target, which becomes problematic when that prior is only approximately
known. We consider a multi-item mechanism design problem where the bidders'
value distributions can be approximated by a topic model. Our solution builds
on a recent robustification framework by Brustle et al., which disentangles the
statistical challenge of estimating a multi-dimensional prior from the task of
designing a good mechanism for it, robustifying the performance of the latter
against the estimation error of the former. We provide an extension of the
framework that allows us to exploit the expressive power of topic models to
reduce the effective dimensionality of the mechanism design problem.
Related papers
- Learning Long-Horizon Predictions for Quadrotor Dynamics [48.08477275522024]
We study the key design choices for efficiently learning long-horizon prediction dynamics for quadrotors.
We show that sequential modeling techniques showcase their advantage in minimizing compounding errors compared to other types of solutions.
We propose a novel decoupled dynamics learning approach, which further simplifies the learning process while also enhancing the approach modularity.
arXiv Detail & Related papers (2024-07-17T19:06:47Z) - The Buffer Mechanism for Multi-Step Information Reasoning in Language Models [52.77133661679439]
Investigating internal reasoning mechanisms of large language models can help us design better model architectures and training strategies.
In this study, we constructed a symbolic dataset to investigate the mechanisms by which Transformer models employ vertical thinking strategy.
We proposed a random matrix-based algorithm to enhance the model's reasoning ability, resulting in a 75% reduction in the training time required for the GPT-2 model.
arXiv Detail & Related papers (2024-05-24T07:41:26Z) - Deep Generative Model-based Synthesis of Four-bar Linkage Mechanisms
with Target Conditions [22.164394511786874]
We propose a deep learning-based generative model for generating multiple crank-rocker four-bar linkage mechanisms.
The proposed model is based on a conditional generative adversarial network (cGAN) with modifications for mechanism synthesis.
The results demonstrate that the proposed model successfully generates multiple distinct mechanisms that satisfy specific kinematic and quasi-static requirements.
arXiv Detail & Related papers (2024-02-22T03:31:00Z) - Efficient Multi-Object Pose Estimation using Multi-Resolution Deformable
Attention and Query Aggregation [19.995626376471765]
We investigate incorporating inductive biases in vision transformer models for multi-object pose estimation.
We propose a query aggregation mechanism that enables increasing the number of object queries without increasing the computational complexity.
We evaluate the proposed model on the challenging YCB-Video dataset and report state-of-the-art results.
arXiv Detail & Related papers (2023-12-13T16:30:00Z) - Refined Mechanism Design for Approximately Structured Priors via Active
Regression [50.71772232237571]
We consider the problem of a revenue-maximizing seller with a large number of items for sale to $n$ strategic bidders.
It is well-known that optimal and even approximately-optimal mechanisms for this setting are notoriously difficult to characterize or compute.
arXiv Detail & Related papers (2023-10-11T20:34:17Z) - On the Embedding Collapse when Scaling up Recommendation Models [53.66285358088788]
We identify the embedding collapse phenomenon as the inhibition of scalability, wherein the embedding matrix tends to occupy a low-dimensional subspace.
We propose a simple yet effective multi-embedding design incorporating embedding-set-specific interaction modules to learn embedding sets with large diversity.
arXiv Detail & Related papers (2023-10-06T17:50:38Z) - High Fidelity Image Counterfactuals with Probabilistic Causal Models [25.87025672100077]
We present a causal generative modelling framework for accurate estimation of high fidelity image counterfactuals with deep structural causal models.
We leverage ideas from causal mediation analysis and advances in generative modelling to design new deep causal mechanisms for structured variables in causal models.
arXiv Detail & Related papers (2023-06-27T19:28:41Z) - Pessimism meets VCG: Learning Dynamic Mechanism Design via Offline
Reinforcement Learning [114.36124979578896]
We design a dynamic mechanism using offline reinforcement learning algorithms.
Our algorithm is based on the pessimism principle and only requires a mild assumption on the coverage of the offline data set.
arXiv Detail & Related papers (2022-05-05T05:44:26Z) - Machine Learning Framework for Quantum Sampling of Highly-Constrained,
Continuous Optimization Problems [101.18253437732933]
We develop a generic, machine learning-based framework for mapping continuous-space inverse design problems into surrogate unconstrained binary optimization problems.
We showcase the framework's performance on two inverse design problems by optimizing thermal emitter topologies for thermophotovoltaic applications and (ii) diffractive meta-gratings for highly efficient beam steering.
arXiv Detail & Related papers (2021-05-06T02:22:23Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.