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

21426283 · Jun 202019922001200920172026
48 results for loss-oracle access

Paper proposes a new black-box attack approach to minimize visual distortion.

problem Constructing adversarial examples that minimize visual distortion in a black-box threat model.
method Learning the noise distribution of adversarial examples to approximate the gradient of a non-differentiable loss function.
result The proposed attack results in much lower visual distortion compared to state-of-the-art black-box attacks.

We present a black-box adversarial attack algorithm which sets new state-of-the-art model evasion rates for query efficiency in the \ell_\infty and 2\ell_2 metrics, where only loss-oracle access to the model is available. On two public black-box attack challenges, the algorithm achieves the highest evasion rate, sur…

2019-02-19abs ↗pdf ↗

The paper enhances preference learning by incorporating response time data.

problem Lack of temporal information in user decision-making for reward model learning.
method Integrates response time alongside binary choice data using the EZ model and Neyman-orthogonal loss functions.
result Response time-augmented approach reduces error rates from exponential to polynomial scaling, improving sample efficiency.

Adaptive market maker curves minimize arbitrage losses in DeFi.

problem Asset trading prices in AMMs trail behind centralized exchanges, causing LP losses.
method Adapts market maker bonding curves to trader behavior using a differential equation derived from the Glosten-Milgrom model.
result Optimal adaptive curves minimize arbitrage losses while remaining competitive.

We use an accessibility result of Delzant and Potyagailo to prove Swarup's Strong Accessibility Conjecture for Gromov hyperbolic groups with no 2-torsion. It follows that, if M is an irreducible, orientable, compact 3-manifold with hyperbolic fundamental group, then any hierarchy in which M is decomposed alternately al…

2007-01-19abs ↗pdf ↗

Novel oracle-type inequality for logistic loss in DNNs achieves sharp convergence rates.

problem Generalization analysis for binary classification with DNNs and logistic loss.
method Established an oracle-type inequality to handle the boundedness of the target function.
result Optimal convergence rates for fully connected ReLU DNN classifiers trained with logistic loss.

MixDiff detects OOD samples in constrained access environments by comparing perturbed samples.

problem Detecting out-of-distribution samples in models with restricted access.
method Apply identical perturbation to target and similar ID sample, compare model outputs.
result MixDiff enhances OOD detection performance consistently across various datasets.

In this paper, we explore a general Aggregated Gradient Langevin Dynamics framework (AGLD) for the Markov Chain Monte Carlo (MCMC) sampling. We investigate the nonasymptotic convergence of AGLD with a unified analysis for different data accessing (e.g. random access, cyclic access and random reshuffle) and snapshot upd…

2019-10-21abs ↗pdf ↗

In this paper, a machine learning based deployment framework of unmanned aerial vehicles (UAVs) is studied. In the considered model, UAVs are deployed as flying base stations (BS) to offload heavy traffic from ground BSs. Due to time-varying traffic distribution, a long short-term memory (LSTM) based prediction algorit…

2020-03-02abs ↗pdf ↗

Role mining tackles the problem of finding a role-based access control (RBAC) configuration, given an access-control matrix assigning users to access permissions as input. Most role mining approaches work by constructing a large set of candidate roles and use a greedy selection strategy to iteratively pick a small subs…

2012-12-19abs ↗pdf ↗

Model analyzes trading frictions in cap-and-trade markets, showing how they interact to affect market effectiveness.

problem Analyzing how trading frictions impact cap-and-trade market effectiveness.
method Developed a dynamic stochastic model with multiple trading frictions, characterized access choices in closed form, and quantified using EU ETS data.
result Trading frictions interact to amplify or dampen market responses, and their combined effect is non-additive.

Algorithm optimizes spectrum access for dynamic multi-user environments.

problem Optimizing spectrum access in uncoordinated multi-user environments with potential collisions.
method Stochastic multi-user bandit framework with estimation and allocation phases.
result Order-optimal system-wide regret of O(logT)O(\log T) for dynamic and static cases.

New algorithm tackles multi-player bandit problems with limited access to arms.

problem Limited access to dynamic local subsets of arms in multi-player multi-armed bandit problems.
method Adopted Upper Confidence Bound (UCB) for exploration-exploitation and distributed optimization for collisions.
result Proposes a decentralized algorithm with near-optimal regret guarantee.

Accessible groups with infinitely many ends have infinitely many twisted conjugacy classes.

problem Characterizing groups with infinitely many ends and their conjugacy classes.
method Analyzing accessible groups and relatively hyperbolic groups to deduce properties.
result Groups with infinitely many ends have infinitely many twisted conjugacy classes.

In this paper we propose a framework for automated forecasting of energy-related time series using open access data from European Network of Transmission System Operators for Electricity (ENTSO-E). The framework provides forecasts for various European countries using publicly available historical data only. Our solutio…

2016-06-02abs ↗pdf ↗

Proposes a new method to selectively access privileged information in reinforcement learning.

problem Selective compression of privileged information in reinforcement learning.
method Formulates a variational bandwidth bottleneck to decide stochastically whether to access privileged information.
result Improves generalization and reduces access to costly information in reinforcement learning experiments.

This paper describes the Speech Technology Center (STC) antispoofing systems submitted to the ASVspoof 2019 challenge. The ASVspoof2019 is the extended version of the previous challenges and includes 2 evaluation conditions: logical access use-case scenario with speech synthesis and voice conversion attack types and ph…

2019-04-11abs ↗pdf ↗

Minimizing a function over an intersection of convex sets is an important task in optimization that is often much more challenging than minimizing it over each individual constraint set. While traditional methods such as Frank-Wolfe (FW) or proximal gradient descent assume access to a linear or quadratic oracle on the …

2018-04-09abs ↗pdf ↗

Study agnostic RL in large state spaces with weak function approximation.

problem Statistical intractability of agnostic policy learning in various environments.
method Investigates agnostic policy learning with different forms of environment access.
result Agnostic policy learning remains statistically intractable with certain forms of environment access.

Satellite imagery and ML improve livelihood measurements and estimate electrification's impact.

problem Sparse data hinders policy development and evaluation.
method Satellite imagery, machine learning, and ML inference techniques.
result Grid access improves rural asset wealth by 0.17 standard deviations.

Theorem converse to Jordan's curve theorem says that {\it if a compact set KK has two complementary domains in R2R^{2}, from each of which it is at every point accessible, it is a simple closed curve}. We show that the requirement of this theorem that {\it all} points of KK were accessible from {\it both} complementa…

2000-09-16abs ↗pdf ↗

LLMs help less-resourced researchers access costly data.

problem Unequal access to costly datasets limits research contributions.
method RAG framework with GPT-4o-mini for automated data collection.
result LLMs can collect CEO pay ratios and CAMs from corporate disclosures with high accuracy and low cost.

Study on women entrepreneurs' access to finance in France.

problem Inequalities in accessing external finance for women entrepreneurs in France.
method Quantitative approach using data from a representative sample of women entrepreneurs.
result Founder status affects access to external finance; increases success in fundraising but reduces bank finance.

In this paper we study a family of variance reduction methods with randomized batch size---at each step, the algorithm first randomly chooses the batch size and then selects a batch of samples to conduct a variance-reduced stochastic update. We give the linear convergence rate for this framework for composite functions…

2018-08-07abs ↗pdf ↗

Saliency maps are often used in computer vision to provide intuitive interpretations of what input regions a model has used to produce a specific prediction. A number of approaches to saliency map generation are available, but most require access to model parameters. This work proposes an approach for saliency map gene…

2020-01-30abs ↗pdf ↗

New methods protect privacy while providing accurate prediction sets.

problem Privacy-preserving conformal prediction for untrusted aggregators.
method Two LDP approaches: k-ary randomized response and binary search response.
result Finite-sample coverage guarantees and robust coverage under randomization.