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

Trend · papers per month

22436586 · Jun 202019922001200920172026
48 results for simultaneous

New algorithm achieves both static and dynamic regret optimally against an oblivious adversary for deterministic losses.

problem Achieving optimal static and dynamic regret simultaneously in adversarial bandits.
method Extends impossibility result to deterministic losses, uses negative static regret and Blackwell approachability.
result First algorithm achieving optimal static and dynamic regret simultaneously against an oblivious adversary.

A new knot invariant measures crossings in three orthogonal directions.

problem Defining a new knot invariant for certain knot diagrams.
method Defining the simultaneous crossing number for knots with doubly transvergent diagrams.
result The limit of the ratio of the new invariant to the usual crossing number is at most 8.

This work finds mixed equilibria in machine learning problems using measures and simultaneous gradient ascent-descent.

problem Finding pure equilibria in machine learning problems is computationally hard.
method Entropic regularization, simultaneous gradient ascent-descent, and particle discretization in the Wasserstein metric.
result Global convergence towards the global equilibrium in mixed equilibria problems.

Proposes a method to optimize budget allocation for collecting and analyzing streaming data.

problem Optimizing resource allocation for collecting and analyzing streaming data.
method Formulates optimization problems to allocate budgets for collecting input data and running simulations, characterizes asymptotic behavior of performance estimators, and develops a multi-stage simultaneous budget allocation procedure.
result Demonstrates competitive performance of the proposed procedure through numerical studies.

We investigate a type of distance between triangulations on finite type surfaces where one moves between triangulations by performing simultaneous flips. We consider triangulations up to homeomorphism and our main results are upper bounds on distance between triangulations that only depend on the topology of the surfac…

2015-09-14abs ↗pdf ↗

We present an efficient algorithm for simultaneously training sparse generalized linear models across many related problems, which may arise from bootstrapping, cross-validation and nonparametric permutation testing. Our approach leverages the redundancies across problems to obtain significant computational improvement…

2013-07-31abs ↗pdf ↗

Support selection and eventwise decoupling for simultaneous bets proven.

problem Optimizing expected utility for simultaneous independent events with multiple outcomes.
method Proved a support theorem for a broad class of strictly increasing strictly concave utilities, identifying the exact active support and proving independence from utility function.
result The exact active support is the eventwise union of single-event supports, independent of the utility function.

This paper studies an environment of simultaneous, separate, first-price auctions for complementary goods. Agents observe private values of each good before making bids, and the complementarity between goods is explicitly incorporated in their utility. For simplicity, a model is presented with two first-price auctions …

2013-12-10abs ↗pdf ↗

We develop a coherent framework for integrative simultaneous analysis of the exploration-exploitation and model order selection trade-offs. We improve over our preceding results on the same subject (Seldin et al., 2011) by combining PAC-Bayesian analysis with Bernstein-type inequality for martingales. Such a combinatio…

2011-05-23abs ↗pdf ↗

Alt-GDA outperforms Sim-GDA in minimax games with near-optimal local convergence.

problem Minimax optimization convergence rate comparison
method Alternating Gradient Descent-Ascent (Alt-GDA) vs. Simultaneous Gradient Descent-Ascent (Sim-GDA)
result Alt-GDA achieves near-optimal local convergence rate for strongly convex-strongly concave problems, while Sim-GDA converges slower.

The paper improves nonparametric confidence bands for band-limited functions.

problem Constructing nonparametric simultaneous confidence bands with nonasymptotic and distribition-free guarantees.
method Based on Paley-Wiener reproducing kernel Hilbert spaces, the paper relaxes assumptions, improves noise estimation, and tightens constraints.
result Enhanced confidence bands with improved efficiency and tighter constraints.

Study flip graphs for surfaces of infinite type, finding uncountably many connected components.

problem Understanding relationships between triangulations of infinite type surfaces via flips.
method Associate triangulations to flip graphs and study sequences of simultaneous flips.
result Flip graphs for infinite type surfaces have uncountably many connected components.

RAF model explains neural networks' dual rule learning and fact memorization.

problem Understanding how neural networks learn rules and memorize facts simultaneously.
method Introduces the Rules-and-Facts (RAF) model to bridge generalization and memorization.
result Characterizes conditions for simultaneous rule learning and fact memorization in neural networks.

New findings on hypersurfaces in Euclidean space that are both maximal and minimal.

problem Characterizing hypersurfaces in Euclidean space that are both maximal and minimal.
method Analyzing the level curves of the hypersurfaces and showing they are minimal hypersurfaces in the lower-dimensional Euclidean space.
result The level curves of these hypersurfaces are minimal hypersurfaces in the lower-dimensional Euclidean space.

A method for constructing tight prediction intervals for multiple numerical outputs.

problem Constructing tight prediction intervals for multiple related numerical outputs.
method A novel coordinate-wise standardization procedure that makes residuals comparable across output dimensions, estimating suitable scaling parameters using calibration data.
result The method produces tighter prediction intervals than existing baselines while maintaining valid simultaneous coverage.

BSFP method reveals latent patterns in multi-omic data for predicting lung function in HIV-associated OLD.

problem Limited understanding of multi-omic molecular phenomena and clinical outcomes in obstructive lung disease.
method Bayesian Simultaneous Factorization and Prediction (BSFP) method for multi-omic data, accommodating imputation and full posterior inference.
result BSFP reveals distinct clusters of patients with OLD and multi-omic patterns related to lung function decline.

Accurate models of patient survival probabilities provide important information to clinicians prescribing care for life-threatening and terminal ailments. A recently developed class of models - known as individual survival distributions (ISDs) - produces patient-specific survival functions that offer greater descriptiv…

2019-06-25abs ↗pdf ↗

Given two observers, we define the "relative velocity" of one observer with respect to the other in four different ways. All four definitions are given intrinsically, i.e. independently of any coordinate system. Two of them are given in the framework of spacelike simultaneity and, analogously, the other two are given i…

2005-06-06abs ↗pdf ↗

Characterizes metrics on Lie groups, proving non-simultaneous existence of balanced and pluriclosed metrics.

problem Existence of balanced and pluriclosed metrics on real semisimple Lie groups.
method Characterization using Vogan diagrams and revisiting complex structure classification.
result Complex manifolds cannot simultaneously admit balanced and pluriclosed metrics.

Simultaneously estimates travel times and route choice model parameters.

problem Interdependent estimation of arc travel times and route choice model parameters.
method Maximum likelihood estimation for any differentiable route choice model.
result Strong performance in real-world data, even compared to arc travel time estimation methods.

Efficient reinforcement learning for simultaneous-move zero-sum games using optimistic value iteration.

problem Learning optimal strategies in simultaneous-move zero-sum Markov games with function approximation.
method Developed an optimistic variant of least-squares minimax value iteration algorithm for offline and online settings.
result Achieved an upper bound of ildeO(d3H3T) ilde O(\sqrt{d^3 H^3 T}) on duality gap and regret.

A distributed bootstrap method for high-dimensional data reduces communication rounds efficiently.

problem Simultaneous inference on massive, high-dimensional data stored across many machines.
method Distributed bootstrap based on de-biased lasso with efficient cross-validation tuning.
result Theoretical lower bound on communication rounds τminτ_{\min} for statistical accuracy and efficiency.

Paper presents a novel gradient-based method for training models and hyperparameters simultaneously.

problem Achieving generalization in machine learning models.
method A novel gradient-based framework that trains parameters and hyperparameters simultaneously.
result Significantly smaller runtime compared to benchmark methods for equivalent prediction scores.

Paper proposes GPM for simultaneous community detection and group synchronization.

problem Simultaneous community detection and group synchronization in networks.
method Generalized Power Method (GPM) for non-convex optimization.
result GPM achieves exact recovery in O(nlog2n)O(n\log^2n) time, outperforming SDP.

The paper improves confidence regions for band-limited functions using tighter norm bounds and majority voting.

problem Constructing reliable confidence regions for band-limited functions from noisy data.
method Improved norm bounds using Hoeffding's inequality and empirical Bernstein bound, majority voting to aggregate intervals.
result Confidence intervals retain their simultaneous coverage guarantee even when aggregated from random subsamples.

Paper proposes algorithms to minimize both dynamic and adaptive regret simultaneously.

problem Traditional regret minimization algorithms are suboptimal for changing environments.
method Developed novel online algorithms to minimize dynamic and adaptive regret simultaneously.
result Proposed algorithms minimize dynamic and adaptive regret over any interval.