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

173347520693 · Jun 202019922001200920172026
48 results for Slot time reduction

New estimator reduces risk in slate bandits by leveraging Bayes risk criterion.

problem Evaluating slate policies using logged data when policies factorize over slots.
method Developed a new estimator using a control variate approach, showing risk improvement over existing methods.
result The new estimator has lower risk than the pseudoinverse estimator in slate bandit problems.

Ranking items to be recommended to users is one of the main problems in large scale social media applications. This problem can be set up as a multi-objective optimization problem to allow for trading off multiple, potentially conflicting objectives (that are driven by those items) against each other. Most previous app…

2016-02-13abs ↗pdf ↗

Dealing with previously unseen slots is a challenging problem in a real-world multi-domain dialogue state tracking task. Other approaches rely on predefined mappings to generate candidate slot keys, as well as their associated values. This, however, may fail when the key, the value, or both, are not seen during trainin…

2019-08-26abs ↗pdf ↗

Typical spoken language understanding systems provide narrow semantic parses using a domain-specific ontology. The parses contain intents and slots that are directly consumed by downstream domain applications. In this work we discuss expanding such systems to handle compound entities and intents by introducing a domain…

2018-10-26abs ↗pdf ↗

Dialogue State Tracking (DST) is a core component of virtual assistants such as Alexa or Siri. To accomplish various tasks, these assistants need to support an increasing number of services and APIs. The Schema-Guided State Tracking track of the 8th Dialogue System Technology Challenge highlighted the DST problem for u…

2020-02-05abs ↗pdf ↗

Task oriented dialog agents provide a natural language interface for users to complete their goal. Dialog State Tracking (DST), which is often a core component of these systems, tracks the system's understanding of the user's goal throughout the conversation. To enable accurate multi-domain DST, the model needs to enco…

2020-02-07abs ↗pdf ↗

New algorithm reduces age of information in wireless networks with unknown channel reliability.

problem Learning optimal source-channel pairs to minimize age of information in wireless networks.
method Introduces AoI regret, novel learning algorithm with bounded AoI regret.
result Developed a learning algorithm with O(1)O(1) AoI regret, improving upon Θ(logT)Θ(\log T).

Algorithm minimizes loss and constraint violations in online convex optimization with smooth penalties.

problem Minimizing loss and constraint violations in online convex optimization with smooth penalties.
method Projected gradient descent over a set around the current action.
result Both dynamic regret and constraint violation are bounded by the path-length.

The paper classifies Killing tensor fields on Riemannian symmetric spaces.

problem Understanding Killing tensor fields on Riemannian symmetric spaces.
method Reduced study to compact irreducible spaces, introduced top slot Killing tensor fields, and classified quadratic fields.
result Quadratic Killing tensor fields on Riemannian symmetric spaces of rank one are spanned by top-slot and decomposable fields.

Predicts fine-grained OD matrices for ridesharing platforms to optimize supply-demand balance.

problem Accurately predicting spatial-temporal OD demands for ridesharing platforms.
method OD-CED model combining unsupervised space coarsening and encoder-decoder architecture.
result Significant improvement in prediction accuracy (45% RMSE reduction, 60% WAPE reduction).

LGAC enhances heat transfer in turbulent boundary layers using slot jets.

problem Enhancing convective heat transfer in turbulent boundary layers.
method Artificial intelligence-based linear genetic algorithms control (LGAC) with slot jets.
result LGAC optimizes heat transfer and flow asymmetry in turbulent boundary layers.

The deep learning trend has recently impacted a variety of fields, including communication systems, where various approaches have explored the application of neural networks in place of traditional designs. Neural networks flexibly allow for data/simulation-driven optimization, but are often employed as black boxes det…

2019-03-09abs ↗pdf ↗

The problem of multi-hypothesis testing with controlled sensing of observations is considered. The distribution of observations collected under each control is assumed to follow a single-parameter exponential family distribution. The goal is to design a policy to find the true hypothesis with minimum expected delay whi…

2019-10-24abs ↗pdf ↗

Framework for optimizing search engine rankings using observational data.

problem Optimizing ranking policies for search engines using limited observational data.
method Formulated expected reward optimization problem, estimated context value distribution, trained ranking policy via Bayesian inference.
result Demonstrated trade-offs in ranking policies trained on empirical reward estimates.

We consider a variant of the classic multi-armed bandit problem where the expected reward of each arm is a function of an unknown parameter. The arms are divided into different groups, each of which has a common parameter. Therefore, when the player selects an arm at each time slot, information of other arms in the sam…

2018-02-22abs ↗pdf ↗

We consider a novel stochastic multi-armed bandit setting, where playing an arm makes it unavailable for a fixed number of time slots thereafter. This models situations where reusing an arm too often is undesirable (e.g. making the same product recommendation repeatedly) or infeasible (e.g. compute job scheduling on ma…

2019-07-27abs ↗pdf ↗

We consider the problem of dynamic buying and selling of shares from a collection of NN stocks with random price fluctuations. To limit investment risk, we place an upper bound on the total number of shares kept at any time. Assuming that prices evolve according to an ergodic process with a mild decaying memory proper…

2009-09-22abs ↗pdf ↗

The paper extends Marsden-Weinstein reduction to mechanical presymplectic structures for time-dependent Hamiltonian systems.

problem Limitations of Marsden-Weinstein reduction for cosymplectic structures in time-dependent Hamiltonian systems.
method Developed Marsden-Weinstein reduction for mechanical presymplectic structures.
result Mechanical presymplectic structures provide a more suitable framework for time-dependent Hamiltonian systems than cosymplectic structures.

New model predicts optimal control for restless bandit problems.

problem Optimizing control in restless bandit problems with minimal assumptions.
method Model Predictive Control with rolling horizon linear programming.
result Sub-optimality gap of O(1/√N) under general conditions, and exp(-Ω(N)) under local-stability condition.

Securely analyzes survival data across multiple institutions without revealing individual patient records.

problem Privacy concerns in federated survival analysis of health data.
method Multiparty homomorphic encryption for approximate floating-point computation and encrypted aggregation.
result Privacy-preserving federated Kaplan--Meier survival analysis with high fidelity and predictable overhead.

The paper proposes an online algorithm for network resource allocation with reduced costs.

problem Optimizing resource allocation and job transfers in a network of servers.
method Randomized online algorithm based on the exponentially weighted method.
result The algorithm achieves sub-linear regret, indicating improved efficiency over time.

Deep actor-critic learning optimizes power control in mobile networks.

problem Optimizing power control in large-scale wireless mobile networks.
method Multi-agent deep reinforcement learning with deep deterministic policy gradient.
result The algorithm maximizes a global utility function in a distributed manner.

The multi-armed bandit (MAB) problem is a classic example of the exploration-exploitation dilemma. It is concerned with maximising the total rewards for a gambler by sequentially pulling an arm from a multi-armed slot machine where each arm is associated with a reward distribution. In static MABs, the reward distributi…

2017-12-08abs ↗pdf ↗

Optimizes energy efficiency in wireless sensor networks with limited information.

problem Maximizing energy efficiency in energy harvesting wireless sensor networks with limited channel state information.
method Modeling as a Multi-Armed Bandits problem and developing an Upper Confidence Bound algorithm.
result Significant gains in energy efficiency compared to benchmark schemes.

Improved time complexity for parallel stochastic optimization in heterogeneous systems.

problem Time complexity in parallel stochastic optimization for large-scale machine learning models.
method Proposes Rennala MVR, a variance-reduced extension of Rennala SGD based on momentum-based variance reduction.
result Variance reduction improves time complexity in relevant parameter regimes for parallel stochastic optimization in heterogeneous systems.

Paper identifies reductive MDPs, solving them in polynomial time.

problem Computational hardness of general MDPs and tractability of finite-horizon MDPs.
method Defines reductivity, a new class of SSPs, and develops a polynomial-time solution.
result Optimal policies can be found in polynomial time for reductive SSPs and MDPs.

In this paper, we investigate the impact of diverse user preference on learning under the stochastic multi-armed bandit (MAB) framework. We aim to show that when the user preferences are sufficiently diverse and each arm can be optimal for certain users, the O(log T) regret incurred by exploring the sub-optimal arms un…

2019-01-23abs ↗pdf ↗