Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

3774110147 · Jun 202019922001200920172026
48 results for Lewis signaling games

The paper investigates how supervised learning and self-play improve sample efficiency in teaching AI to communicate.

problem Improving sample efficiency in training AI to use natural language.
method Investigates the relationship between supervised learning and self-play, introduces supervised self-play (S2P).
result First training agents via supervised learning followed by self-play outperforms self-play followed by supervised learning.

The study compares DLS method with machine learning for cricket match result prediction.

problem Improving accuracy of Duckworth-Lewis-Stern method for cricket match result prediction.
method Comparison of Duckworth-Lewis-Stern method with various supervised learning algorithms and optimization of DLS resource table.
result Development of Unpredictability Index to rank nations based on unpredictability in ODI matches.

Game theory models how agents trade in a risky asset considering price impact and a common signal.

problem Modeling how financial agents liquidate assets in a risky market with price impact and a common signal.
method Formulated and solved a multi-player stochastic differential game and mean field game.
result Equilibrium strategies reveal how agents adjust the predictive trading signal to price impact.

LEWIS merges LLMs without training, improving performance on specific tasks.

problem Limited performance improvement of merged models on specific benchmarks.
method Guided model merging using layer-wise sparsity and task-vector pruning.
result Improved model performance by up to 11.3% on math-solving tasks.

Solves a game between brokers and informed traders using stochastic differential equations.

problem Optimizing wealth in a game between brokers and informed traders with private signals.
method Closed-form solutions to a mean-field game using forward-backward SDEs.
result Optimal trading strategies for both brokers and informed traders are found.

The paper proposes a method to solve L1 regression with fewer labels using Lewis weights.

problem Finding an approximate solution to L1 regression with limited labels.
method Sampling rows of the data matrix XX according to its Lewis weights and using the empirical minimizer.
result The method succeeds with high probability and has an optimal error bound.

Algorithm solves robust linear regression with block Lewis weights.

problem Group distributionally robust least squares problem.
method Algorithm based on geometric construction and block Lewis weights, using accelerated proximal methods.
result Improves over known methods for moderate accuracy regimes and matches state-of-the-art guarantees.

Self-supervised learning of visual semantics in image games.

problem Learning visual semantics in referential emergent language games.
method Investigating the impact of feature extractor weights and tasks on visual semantics, using various image augmentations and additional tasks.
result Communication systems can learn visual semantics in a self-supervised manner by playing the right types of games.

A framework disentangles controllable objects from visual signals for improved RL.

problem Improving sample efficiency and game performance in vision-based RL.
method Action-conditioned video prediction to disentangle controllable objects.
result Improved sample efficiency and game performance in Atari games.

This paper relaxes the common prior assumption in the public and private information game of Morris and Shin (2000, 2004). For the generalized game, where the agent's prior expectations are heterogenous, it derives a sharp condition for the emergence of unique/multiple equilibria. This condition indicates that unique e…

2013-12-30abs ↗pdf ↗

A neural network and evolutionary algorithm framework designs nonlinear optical molecules.

problem Designing efficient nonlinear optical materials.
method Multi-stage Bayesian neural network (msBNN) and corrected Lewis-mode group contribution method (cLGC) combined with evolutionary algorithm (EA).
result Accurately and efficiently designs molecules with different optical properties using a small data set.

Designs efficient algorithms for online and sliding window models of subspace embeddings for all p.

problem Design efficient algorithms for online and sliding window models of subspace embeddings for all p.
method Develops nearly optimal p\ell_p subspace embeddings for all p(0,)p\in(0,\infty) in the online coreset and sliding window models.
result First nearly optimal p\ell_p subspace embeddings for all p(0,)p\in(0,\infty) in the online coreset and sliding window models.

Study callable convertible bonds with liquidity constraints, generalizing previous work.

problem Callable convertible bond problem with liquidity constraints.
method Introduced a new technique to handle non-ordered payoff situations.
result Complete solution to callable convertible bond problem with liquidity constraint.

Partial-monitoring games constitute a mathematical framework for sequential decision making problems with imperfect feedback: The learner repeatedly chooses an action, opponent responds with an outcome, and then the learner suffers a loss and receives a feedback signal, both of which are fixed functions of the action a…

2011-02-10abs ↗pdf ↗

RHMC improves sampling polytopes defined by inequalities with barriers.

problem Sampling polytopes defined by inequalities efficiently.
method Riemannian Hamiltonian Monte Carlo (RHMC) with a hybrid of Lewis weights and logarithmic barriers.
result RHMC achieves mixing rate of ildeO(m1/3n4/3) ilde O(m^{1/3}n^{4/3}) for polytopes defined by mm inequalities in Rn\R^n.

Calibrated strategies can be obtained by performing strategies that have no internal regret in some auxiliary game. Such strategies can be constructed explicitly with the use of Blackwell's approachability theorem, in an other auxiliary game. We establish the converse: a strategy that approaches a convex BB-set can be…

2010-06-09abs ↗pdf ↗

In approachability with full monitoring there are two types of conditions that are known to be equivalent for convex sets: a primal and a dual condition. The primal one is of the form: a set C is approachable if and only all containing half-spaces are approachable in the one-shot game; while the dual one is of the form…

2013-05-23abs ↗pdf ↗

This research tackles information design in multi-agent reinforcement learning.

problem Designing information to influence other adaptive agents in a non-stationary environment.
method Formulated Markov signaling game, introduced signaling gradient and extended obedience constraints.
result Developed efficient algorithm for mixed-motive tasks in multi-agent reinforcement learning.

A free action of the direct product of two copies of the symmetric group on 3 elements on the cartesian product of two copies of the 3-sphere is constructed. This nonlinear action is constructed using surgery. The action provides a counterexample to a conjecture of Lewis made in 1968.

1998-06-06abs ↗pdf ↗

We prove an existence theorem for Spin(7)-instantons, which are highly concentrated near a Cayley submanifold; thus giving a partial converse to Tian's foundational compactness theorem. As an application, we show how to construct Spin(7)-instantons on Spin(7)-manifolds with suitable local K3 Cayley fibrations. This rec…

2014-09-23abs ↗pdf ↗

Starting from the candidate Bloch-Beilinson filtration on Chow groups of 0-cycles constructed by J. Lewis, we develop and describe geometrically a series of Hodge-theoretic invariants defined on the graded pieces. Explicit formulas (in terms of currents and membrane integrals) are given for certain quotients of the inv…

2005-04-05abs ↗pdf ↗

Reinforcement learning algorithms rely on carefully engineering environment rewards that are extrinsic to the agent. However, annotating each environment with hand-designed, dense rewards is not scalable, motivating the need for developing reward functions that are intrinsic to the agent. Curiosity is a type of intrins…

2018-08-13abs ↗pdf ↗

Study optimal trading strategies with differing views and market prices.

problem Maximizing portfolio value with subjective asset value vs market price.
method Mean-field game approach to analyze interactions among agents with differing signals.
result Cross-sectional distribution of agents' inventories and price distribution dependence on shared information.

Study on liquidity and market efficiency in auction games with imperfect information.

problem Generating liquidity in illiquid auction markets with imperfect information.
method Characterized Nash equilibria in a two-player game with imperfect information, linking market spreads to signal strength.
result Without incentives, the market is inefficient and does not lead to trades. Quadratic fees indexed on half spread can generate liquidity.

This paper improves self-play learning in games by manipulating experience distributions.

problem Improving self-play learning in games through better experience sampling.
method Three approaches: weighted sampling, Prioritized Experience Replay, and diversifying trajectories.
result Major improvements in early training performance in some games, minor improvements overall.

In this paper the extended model of Minority game (MG), incorporating variable number of agents and therefore called Grand Canonical, is used for prediction. We proved that the best MG-based predictor is constituted by a tremendously degenerated system, when only one agent is involved. The prediction is the most effici…

2013-09-13abs ↗pdf ↗

New model estimates signals from noisy data using robust optimization.

problem Estimating signals from noisy observations with uncertainty.
method Wasserstein distributionally robust optimization for minimax MSE estimation.
result Nash equilibrium found for optimal estimator and prior.

Improved subsampling bounds for p\ell_p sensitivity sampling using 2\ell_2 augmentation.

problem Efficiently approximating large data sets by small representative proxies.
method Optimized sampling based on p\ell_p and 2\ell_2 sensitivities.
result Optimal linear ildeO(ε2(S+d)) ilde O(\varepsilon^{-2}(\mathfrak S+d)) sampling complexity for all p[1,2]p \in [1,2].

The CGMY model's ATM call-price asymptotics are derived using characteristic function.

problem Deriving short-time asymptotics for the CGMY model's ATM call prices.
method Using the characteristic function, derived short-time asymptotics for the CGMY model's ATM call prices. Extracted higher-order coefficients by dynamic cutoff partitioning.
result Higher-order coefficients are derived for the CGMY model's ATM call prices.

Spectral estimation (SE) aims to identify how the energy of a signal (e.g., a time series) is distributed across different frequencies. This can become particularly challenging when only partial and noisy observations of the signal are available, where current methods fail to handle uncertainty appropriately. In this c…

2018-09-06abs ↗pdf ↗

The paper presents a novel approach of spoofing wireless signals by using a general adversarial network (GAN) to generate and transmit synthetic signals that cannot be reliably distinguished from intended signals. It is of paramount importance to authenticate wireless signals at the PHY layer before they proceed throug…

2019-05-03abs ↗pdf ↗

Deep reinforcement learning has obtained significant breakthroughs in recent years. Most methods in deep-RL achieve good results via the maximization of the reward signal provided by the environment, typically in the form of discounted cumulative returns. Such reward signals represent the immediate feedback of a partic…

2018-09-07abs ↗pdf ↗

We obtain very sharp results about the lack of validity of the Poincare lemma for the tangential Cauchy Riemann equations, acting on tangential forms, tangential to a CR manifold M of general CR dimension n, and general CR codimension k. This generalizes the classical nonsolvability example of H. Lewy. We also discuss …

2007-10-18abs ↗pdf ↗