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,657 papers · 148 categories

Trend · papers per month

3875113150 · May 202619922001200920172026
48 results for two-sided uncertainty

Algorithm identifies optimal stable matching in uncertain two-sided markets.

problem Sequential learning in two-sided markets with unknown preferences.
method Pure exploration approach with elimination-based algorithms exploiting partial preference information.
result Identification of pervasive stable matching for optimal stable matching identification.

The paper addresses statistical inference in matching markets with dependent missingness.

problem Statistical inference for two-sided matching markets with matching-induced dependence.
method Non-convex algorithm based on Grassmannian gradient descent, debiasing and projection framework.
result Near-optimal entrywise convergence rates for various matching mechanisms.

We study how information perturbations can destabilize two-sided matching markets. In our model, agents arrive on the market over two periods, while agents in the first period do not know the types of those arriving later. Agents already present in the market may match early or wait for the small group of new entrants.…

2010-09-03abs ↗pdf ↗

We define a notion of Hempel distance for one-sided Heegaard splittings and show that the existence of alternate surfaces restricts distance for one-sided splittings in a manner similar to Hartshorn's and Scharlemann-Tomova's results for two-sided splittings. We also show that every geometrically compressible one-sided…

2011-12-02abs ↗pdf ↗

DINOSAUR improves retrieval by accounting for embedding uncertainty in recommender systems.

problem Retrieval bias towards popular items due to noisy embeddings.
method Samples multiple embeddings per item and queries with sampled embeddings to account for uncertainty.
result Improves coverage of long-tail niche content without sacrificing recall.

A new framework uses multi-agent reinforcement learning for evaluating policies in two-sided markets.

problem Evaluating the effects of different policies in two-sided markets with spatial and temporal interference.
method Introduces a multi-agent reinforcement learning (MARL) framework to address policy evaluation challenges in large-scale fleet management.
result Proposes novel estimators for mean outcomes under different products that are consistent despite high-dimensionality.

Multi-view clustering has received much attention recently. Most of the existing multi-view clustering methods only focus on one-sided clustering. As the co-occurring data elements involve the counts of sample-feature co-occurrences, it is more efficient to conduct two-sided clustering along the samples and features si…

2019-05-25abs ↗pdf ↗

Study uses RL to optimize crypto portfolios with two-sided transactions and lending.

problem Managing downside risk and capital optimization in high-risk crypto markets.
method Integrates RL with a new environmental formulation and PnL-based reward function, using SAC agent with CNN-MHA.
result Significantly outperforms benchmarks, especially in high-volatility scenarios.

A method for rank verification in multivariate Gaussian data, improving on existing approaches.

problem Determining the top KK means in multivariate Gaussian data with any covariance structure.
method Selective inference tools to generalize the two-sided difference-of-means test for any KK and covariance structure.
result The method provides a generalization for rank verification in multivariate Gaussian data with any covariance structure.

Perimeter minimizers in curved spaces have a singular set no more than 5 dimensions.

problem Understanding the structure of minimizers in spaces with bounded Ricci curvature.
method Analysis of non-collapsed Ricci limit spaces with two-sided curvature bounds.
result The Hausdorff dimension of the singular set is at most \(N-5\).

Sharp bound on singular set dimension for specific geometric problems.

problem Hausdorff dimension of singular set in free boundary problems.
method Analysis of noncollapsed limits of manifolds with Ricci curvature bounds.
result Dimension bound of singular set is n5n-5.

We show that for an immersed two-sided minimal surface in R3R^3, there is a lower bound on the index depending on the genus and number of ends. Using this, we show the nonexistence of an embedded minimal surface in R3R^3 of index 22, as conjectured by Choe. Moreover, we show that the index of a immersed two-sided mini…

2014-05-28abs ↗pdf ↗

The combined work of Guaraco, Hutchinson, Tonegawa and Wickramasekera has recently produced a new proof of the classical theorem that any closed Riemannian manifold of dimension n+13n + 1 \geq 3 contains a minimal hypersurface with a singular set of Hausdorff dimension at most n7n-7. This proof avoids the Almgren--Pitts …

2017-04-25abs ↗pdf ↗

Characterizes closures of mapping class group orbits on non-orientable surfaces.

problem Understanding closures of orbits in Teichmüller spaces for non-orientable surfaces.
method Analyzes closures in ML\mathcal M\mathcal L and PML\mathcal P\mathcal M\mathcal L for measured laminations, projective measured laminations, and points.
result Characterizes closures of weighted two-sided curves in ML\mathcal M\mathcal L.

In the curve complex for a surface, a handlebody set is the set of loops that bound properly embedded disks in a given handlebody bounded by the surface. A boundary set is the set of non-separating loops in the curve complex that bound two-sided, properly embedded surfaces. For a Heegaard splitting, the distance betwee…

2007-07-04abs ↗pdf ↗

It was recently proved that embedded solutions of Euclidean hypersurface flows with speeds given by concave (convex), degree one homogeneous functions of the Weingarten map are interior (exterior) non-collapsing. These results were subsequently extended to hypersurface flows in the sphere and hyperbolic space. In the f…

2013-10-02abs ↗pdf ↗

New findings on stable minimal hypersurfaces in curved 4-manifolds.

problem Nonexistence of complete stable minimal hypersurfaces in positively curved 4-manifolds.
method Combination of non-negative sectional curvature and strict positivity of scalar curvature.
result Rigidity of complete stable minimal hypersurfaces in 4-manifolds with positive curvature.

Motivated by the construction of spectral manifolds in noncommutative geometry, we introduce a higher degree Heisenberg commutation relation involving the Dirac operator and the Feynman slash of scalar fields. This commutation relation appears in two versions, one sided and two sided. It implies the quantization of the…

2014-11-04abs ↗pdf ↗

In this paper we push forward results on the invariant F{\cal F}-module of a virtual knot investigated by the first named author where F{\cal F} is the algebra with two invertible generators A,BA,B and one relation A1B1ABB1AB=BA1B1AAA^{-1}B^{-1}AB-B^{-1}AB= BA^{-1}B^{-1}A-A. For flat knots and links the two sides of the relation equa…

2006-10-16abs ↗pdf ↗

Algorithm solves two-sided matching markets with unknown preferences and constraints.

problem Two-sided online matching markets with complementary preferences and quota constraints.
method Formulated as a bandit learning problem, proposed MMTS algorithm combining Thompson Sampling and double matching.
result MMTS achieves stability and linear Bayesian regret with respect to quota and time horizon.

Dynamic assortment problem on two-sided platform with unknown parameters

problem Optimizing assortment display in an online platform with incomplete information and heterogeneous customers
method Data-driven algorithm that learns choice parameters while optimizing revenue
result Worst-case regret grows polylogarithmically over time

New algorithm for decentralized matching markets without prior preference rankings.

problem Decentralized two-sided matching markets without known preference rankings.
method Epoch-based CA-ETC algorithm for decentralized matching markets.
result Achieves player optimal expected regret of O(T_0 (K log T / T_0 Δ^2)^(1/γ) + T_0 (T / T_0)^γ).

In recent years, several families of hyperbolic knots have been shown to have both volume and λ1λ_1 (first eigenvalue of the Laplacian) bounded in terms of the twist number of a diagram, while other families of knots have volume bounded by a generalized twist number. We show that for general knots, neither the twist nu…

2009-01-02abs ↗pdf ↗

Using basic properties of one-sided Heegaard splittings, a direct proof that geometrically compressible one-sided splittings of RP^3 are stabilised is given. The argument is modelled on that used by Waldhausen to show that two-sided splittings of S^3 are standard.

2005-09-01abs ↗pdf ↗

New conditions ensure Dantzig-Wolfe relaxation matches rank-constrained optimization problems.

problem Rank-constrained optimization problems with linear matrix inequalities.
method Investigates Dantzig-Wolfe relaxation and develops conditions for exactness.
result Conditions for extreme point, convex hull, and objective exactness.