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

0.9%1.8%2.7%3.7% · May 202619922001200920172026
48 results for oracle interfaces

A new method learns the optimal pricing map for semiparametric dynamic pricing problems.

problem Optimizing pricing strategies in a semiparametric valuation model with unknown utility and noise.
method Developed a modular policy called ORBIT that uses a scalar pilot index, localizes a benchmark price, and learns a local polynomial approximation of the oracle price map.
result Achieves regret bound of \( \widetilde{O}\big(T^{\frac{2β-1}{4β-3}}+\sqrt{dT}\big) \) for the linear utility model and minimax sharp lower bound.

Neuroprosthetic brain-computer interfaces function via an algorithm which decodes neural activity of the user into movements of an end effector, such as a cursor or robotic arm. In practice, the decoder is often learned by updating its parameters while the user performs a task. When the user's intention is not directly…

2015-11-13abs ↗pdf ↗

New interface explains contextual bandits to non-experts.

problem Interpreting and managing contextual bandits for non-expert operators.
method Developed a metric 'value gain' for off-policy evaluation and designed an interface to explain bandit behavior.
result Empowered non-experts to manage complex machine learning systems through accessible presentation.

An assistant learns to mediate decisions between humans and experts, balancing risk and learning.

problem Learning to mediate decisions between imperfect humans and expert knowledge.
method Formalizes online decision mediation, proposes a policy to balance immediate loss and future generalization.
result Consistent gains over benchmarks in decision-making performance.

We consider the regularity of an interface between two incompressible and inviscid fluids flows in the presence of surface tension. We obtain local in time estimates on the interface in H32k+1H^{\frac32k +1} and the velocity fields in H32kH^{\frac32k}. These estimates are obtained using geometric considerations which show th…

2006-09-20abs ↗pdf ↗

Study boundary behavior of limit interfaces in Riemannian manifolds without convexity assumptions.

problem Boundary behavior of limit interfaces in Riemannian manifolds.
method Proves limit-interface is a free boundary varifold, integer rectifiable up to boundary.
result No convexity assumption required; valid even when limit-interface clusters near boundary.

Deep learning predicts curvature of 2D interfaces in level-set method.

problem Estimating curvature in level-set method for complex interfaces.
method Deep learning using feed-forward neural networks trained on synthetic data.
result Deep learning models approximate curvature with comparable precision to traditional methods.

Analytic patch trees reveal new geometric structures and dimension fields.

problem Understanding the geometric and analytical properties of surface patch trees.
method Developed analytic surface patch trees and introduced interface curves to transmit state.
result Surface patch trees have natural foliations with one-dimensional curve trees and dimension fields.

Common models for two-phase lipid bilayer membranes are based on an energy that consists of an elastic term for each lipid phase and a line energy at interfaces. Although such an energy controls only the length of interfaces, the membrane surface is usually assumed to be at least C1C^1 across phase boundaries. We consi…

2016-03-01abs ↗pdf ↗

This paper uses bandit algorithms to reduce the cost of user interface experimentation in online retail.

problem Reducing the cost of user interface experimentation in online retail.
method Modeling user interface experimentation as an opportunistic bandit problem, reducing the cost of exploration.
result Significant regret reduction and improved contextual information for testing.

Oracle-efficient algorithms reduce combinatorial semi-bandit regret to logarithmic time.

problem Scalability issue in combinatorial semi-bandit problems due to high combinatorial optimization costs.
method Oracle-efficient frameworks that minimize oracle queries while maintaining tight regret guarantees.
result Achieved ildeO(T) ilde{O}(\sqrt{T}) regret with O(loglogT)O(\log\log T) oracle queries for worst-case linear rewards.

We present sktime -- a new scikit-learn compatible Python library with a unified interface for machine learning with time series. Time series data gives rise to various distinct but closely related learning tasks, such as forecasting and time series classification, many of which can be solved by reducing them to relate…

2019-09-17abs ↗pdf ↗

New analysis shows Thompson Sampling can work with greedy approximations in combinatorial bandits.

problem Thompson Sampling's theoretical limits with greedy approximations in combinatorial semi-bandits.
method Study with greedy oracle, providing lower and upper bounds on regret.
result First theoretical results showing TS can work with greedy approximations, breaking misconceptions.

Study on evolving interfaces with complex curvature and density effects.

problem Understanding the dynamics of evolving heterogeneous elastic interfaces.
method Modeling an evolving curve with a density function, analyzing the associated gradient flow evolution.
result Analysis of the preservation and asymptotic behavior of geometric properties in the evolving system.

MAMBA learns policies competitive with multiple conflicting oracles.

problem Learning policies from multiple conflicting oracles in reinforcement learning.
method MAMBA uses a gradient estimator in the style of GAE to optimize policies, leveraging demonstrations from multiple weak oracles.
result MAMBA outperforms the state-of-the-art in learning policies competitive with multiple conflicting oracles.

We study the problem of interactively learning a binary classifier using noisy labeling and pairwise comparison oracles, where the comparison oracle answers which one in the given two instances is more likely to be positive. Learning from such oracles has multiple applications where obtaining direct labels is harder bu…

2017-04-19abs ↗pdf ↗

Study on liquid-vapor interfaces in stable equilibrium without assuming prior regularity.

problem Understanding the conditions for a liquid-vapor interface to be in stable equilibrium without assuming prior regularity.
method Proposes a weakest set of mathematical assumptions using varifold regularity theory and identifies a suitable stability condition.
result The liquid-vapor interface is a smoothly embedded analytic surface in stable equilibrium.

In this paper, we consider multi-valued graphs with a prescribed real analytic interface that minimize the Dirichlet energy. Such objects arise as a linearized model of area minimizing currents with real analytic boundaries and our main result is that their singular set is discrete in 2 dimensions. This confirms (and p…

2019-06-24abs ↗pdf ↗

New oracle uses uncertainty for active classification with noisy feedback.

problem Improving query complexity in interactive binary classifier learning.
method Proposes a new pairwise comparison oracle that considers uncertainty and an adaptive labeling algorithm.
result Demonstrates improved performance and efficiency compared to existing methods.

Quantum oracles help identify counterfactuals better than classical ones.

problem Identifying unknown causal parameters in causal models.
method Using quantum oracles to query and identify all causal parameters and counterfactuals.
result Quantum oracles enable identification of all two-way joint counterfactuals and tighter bounds on higher-order counterfactuals.

Paper addresses online alignment of large language models under uncertain preference feedback.

problem Online alignment of large language models with misspecified preference feedback.
method Formulates an oracle-robust objective as a worst-case optimization problem for log-linear policies, and develops projected stochastic composite updates.
result Shows that the robust objective admits an exact closed-form decomposition and achieves O~(ε2)\widetilde{O}(\varepsilon^{-2}) oracle complexity.

We propose that a simple, Lagrangian 2d N=(0,2)\mathcal{N}=(0, 2) duality interface between the 3d N=2\mathcal{N}=2 XYZ model and 3d N=2\mathcal{N}=2 SQED can be associated to the simplest triangulated 4-manifold: the 4-simplex. We then begin to flesh out a dictionary between more general triangulated 4-manifolds with boundar…

2019-05-13abs ↗pdf ↗

New oracles improve stochastic optimization with noisy or biased measurements.

problem Optimizing functions with noisy or biased measurements.
method Introduced biased gradient oracles for stochastic optimization, analyzed RSG and SGD algorithms with these oracles.
result Derived non-asymptotic bounds for convergence rates of algorithms with biased gradient oracles.

Brain-Machine Interfaces (BMIs) have recently emerged as a clinically viable option to restore voluntary movements after paralysis. These devices are based on the ability to extract information about movement intent from neural signals recorded using multi-electrode arrays chronically implanted in the motor cortices of…

2018-09-28abs ↗pdf ↗

Algorithm solves online binary classification and infinite games using ERM oracle.

problem Online learning and solving infinite games with computationally inefficient oracles.
method Proposes an algorithm relying solely on ERM oracle calls for online binary classification and nonparametric games.
result Achieves finite and sublinearly growing regret in various settings.

New study shows Gaussian samplers struggle with heavy-tailed targets, while stable samplers excel.

problem The difficulty of sampling from heavy-tailed distributions using Gaussian versus stable oracles.
method Comparison of Gaussian and stable oracles for proximal samplers.
result Gaussian samplers have a fundamental barrier for high-accuracy guarantees in heavy-tailed sampling, while stable samplers excel.

Study on tradeoffs between mistakes and ERM oracle calls in online and transductive learning.

problem Analyzing online and transductive learning with limited ERM and weak consistency oracle access.
method Proves lower bounds and upper bounds on mistakes and oracle calls, considering realizable and agnostic cases.
result Achieves optimal mistake bounds with weak consistency queries for certain concept classes.

Study stability and bifurcation of liquid interfaces in cylindrical supports.

problem Stability and bifurcation of liquid interfaces in cylindrical support surfaces.
method Analysis of eigenvalues of the Jacobi operator, Plateau-Rayleigh instability, bifurcation theory.
result Conditions for the emergence of new morphologies and bifurcations from circular cylinders.

We address the double bubble problem for the anisotropic Grushin perimeter PαP_α, α0α\geq 0, and the Lebesgue measure in R2\mathbb R^2, in the case of two equal volumes. We assume that the contact interface between the bubbles lays on either the vertical or the horizontal axis. Since no regularity theory is available i…

2017-12-31abs ↗pdf ↗