Coordinate descent methods usually minimize a cost function by updating a random decision variable (corresponding to one coordinate) at a time. Ideally, we would update the decision variable that yields the largest decrease in the cost function. However, finding this coordinate would require checking all of them, which…
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
48 results for “Coordinated Decisions”
New algorithm learns coordinated decisions in loosely-coupled multi-agent systems.
problem Learning coordinated decisions in multi-agent systems with sparse interactions.
method Multi-Agent Thompson Sampling (MATS) for multi-agent multi-armed bandits.
result MATS achieves sublinear regret and outperforms MAUCE on synthetic and real benchmarks.
ATLAS uses LLMs to adaptively trade by optimizing prompts and coordinating agents.
problem Adapting LLMs for real-time financial decision-making in noisy markets.
method ATLAS integrates structured market data, uses Adaptive-OPRO for prompt optimization, and employs multi-agent coordination.
result Adaptive-OPRO consistently outperforms fixed prompts in financial trading.
Capacity control, the bias/variance dilemma, and learning unknown functions from data, are all concerned with identifying effective and consistent fits of unknown geometric loci to random data points. A geometric locus is a curve or surface formed by points, all of which possess some uniform property. A geometric locus…
RL optimizes resource allocation in MG by balancing experience and exploration.
problem Optimal resource allocation in competitive scenarios.
method Introduced RL to MG, allowing dynamic strategy adjustment based on experience and expected rewards.
result Achieves optimal resource coordination by balancing exploitation and exploration.
AgensFlow learns multi-agent coordination policies from experience.
problem Difficult coordination choices in multi-agent systems built on LLMs.
method Online policy learning from repeated trajectories, treating decisions as learnable.
result Learned routing improves coordination-heavy workflows over static wiring.
A new embedding method for high-dimensional data.
problem Handling large sample sizes in high-dimensional spaces.
method Partitioning space into simplices and embedding into barycentric coordinates.
result Linear classifier in rich feature space yields highly non-linear decision boundaries.
Coordinate descent methods employ random partial updates of decision variables in order to solve huge-scale convex optimization problems. In this work, we introduce new adaptive rules for the random selection of their updates. By adaptive, we mean that our selection rules are based on the dual residual or the primal-du…
New algorithms allow multiple robots to search efficiently without central coordination.
problem Efficiently locating targets in an unknown environment with multiple robots.
method SPATS and LATSI algorithms for asynchronous multi-agent active search.
result Multiple robots can independently make data-collection decisions without a central coordinator.
A model for human-machine decision-making with private info and opacity.
problem Optimizing decisions in a human-machine system with private info and opacity.
method Formulated as a two-player learning problem, proved lower and upper bounds on optimality.
result Simple coordination strategy is nearly minimax optimal, efficient learning possible under certain assumptions.
New AI assistant for power grid operators simplifies complex decision-making.
problem Complexity and uncertainty in power grid operations.
method Unified human-machine interface and AI integration.
result Development of a new assistant framework for power grid operators.
We address challenges in collaborative black-box optimization through three frameworks.
problem Challenges in distributed experimentation, heterogeneity, and privacy in black-box optimization.
method Three unifying frameworks: global, local, and predictive.
result Shift from descriptive/predictive to prescriptive federated learning in black-box optimization.
Modern vehicle fleets, e.g., for ridesharing platforms and taxi companies, can reduce passengers' waiting times by proactively dispatching vehicles to locations where pickup requests are anticipated in the future. Yet it is unclear how to best do this: optimal dispatching requires optimizing over several sources of unc…
Intrinsically motivated reinforcement learning aims to address the exploration challenge for sparse-reward tasks. However, the study of exploration methods in transition-dependent multi-agent settings is largely absent from the literature. We aim to take a step towards solving this problem. We present two exploration m…
Selection of appropriate collective variables for enhancing sampling of molecular simulations remains an unsolved problem in computational biophysics. In particular, picking initial collective variables (CVs) is particularly challenging in higher dimensions. Which atomic coordinates or transforms there of from a list o…
How do groups of individuals achieve consensus in movement decisions? Do individuals follow their friends, the one predetermined leader, or whomever just happens to be nearby? To address these questions computationally, we formalize "Coordination Strategy Inference Problem". In this setting, a group of multiple individ…
The method of block coordinate gradient descent (BCD) has been a powerful method for large-scale optimization. This paper considers the BCD method that successively updates a series of blocks selected according to a Markov chain. This kind of block selection is neither i.i.d. random nor cyclic. On the other hand, it is…
Develops a new framework for analyzing sequential decision-making problems using information theory.
problem Lack of information-theoretic generalization bounds for sequential decision-making problems.
method Introduces a sequential supersample framework that separates learner filtration from proof-side enlargement, controlling the generalization gap by sequential CMI.
result Establishes a sequential CMI that controls the generalization gap in sequential decision-making problems.
Paper tackles inventory management with deep learning, improving performance and adherence to constraints.
problem Managing inventory with limited resources and constraints.
method Proposes a novel method to sample from a distribution of possible constraint paths, extends exo-IDP formulation, introduces neural coordinator, and uses modified DirectBackprop algorithm.
result Deep reinforcement learning policies with a neural coordinator outperform classic baselines in terms of performance and adherence to constraints.
We introduce canonical correlation forests (CCFs), a new decision tree ensemble method for classification and regression. Individual canonical correlation trees are binary decision trees with hyperplane splits based on local canonical correlation coefficients calculated during training. Unlike axis-aligned alternatives…
Recent developments in deep reinforcement learning are concerned with creating decision-making agents which can perform well in various complex domains. A particular approach which has received increasing attention is multi-agent reinforcement learning, in which multiple agents learn concurrently to coordinate their ac…
Pursuit-evasion is a multi-agent sequential decision problem wherein a group of agents known as pursuers coordinate their traversal of a spatial domain to locate an agent trying to evade them. Pursuit evasion problems arise in a number of import application domains including defense and route planning. Learning to opti…
Patient summarization is essential for clinicians to provide coordinated care and practice effective communication. Automated summarization has the potential to save time, standardize notes, aid clinical decision making, and reduce medical errors. Here we provide an upper bound on extractive summarization of discharge …
Risk management in dynamic decision problems is a primary concern in many fields, including financial investment, autonomous driving, and healthcare. The mean-variance function is one of the most widely used objective functions in risk management due to its simplicity and interpretability. Existing algorithms for mean-…
There is an increasing demand for computing the relevant structures, equilibria and long-timescale kinetics of biomolecular processes, such as protein-drug binding, from high-throughput molecular dynamics simulations. Current methods employ transformation of simulated coordinates into structural features, dimension red…
Initial DR studies mainly adopt model predictive control and thus require accurate models of the control problem (e.g., a customer behavior model), which are to a large extent uncertain for the EV scenario. Hence, model-free approaches, especially based on reinforcement learning (RL) are an attractive alternative. In t…
RLMM extends psychometric models to larger tasks.
problem Sequential process data from interactive assessments are not well handled by conventional models.
method RLMM decouples person-level choice sensitivity from task-level value representation through a shared parametric action-value function.
result RLMM achieves higher estimation accuracy and lower runtime than MDP-MM in peg-solitaire simulations and AQUALAB gameplay logs.
To date, pavement management software products and studies on optimizing the prioritization of pavement maintenance and rehabilitation (M&R) have been mainly focused on three parameters; the pre-treatment pavement condition, the rehabilitation cost, and the available budget. Yet, the role of the candidate projects' spa…
Study embeds PC matrices into Grassmannian manifold for geometric interpretation.
problem Understanding algebraic consistency of pairwise comparisons matrices.
method Leverages Plücker coordinates and geometric interpretation of Grassmannian manifold.
result Algebraic consistency condition is equivalent to geometric consistency in .
ARCO-BO optimizes multi-agent design under heterogeneity, improving efficiency and performance.
problem Heterogeneous multi-agent optimization challenges in resource use and information sharing.
method ARCO-BO integrates a consensus mechanism, budget-aware sampling, and partial input sharing for heterogeneous design spaces.
result ARCO-BO outperforms independent and collaborative BO methods in complex multi-agent settings.
A method for interpreting SVMs using polynomial kernels, revealing model complexity.
problem Interpreting SVMs built with truncated orthogonal polynomial kernels.
method Orthogonal Representation Contribution Analysis (ORCA) with normalized Orthogonal Kernel Contribution (OKC) indices.
result The method reveals structural aspects of model complexity not captured by predictive accuracy.
We study "active" decision making over sensor networks where the sensors' sequential probing actions are actively chosen by continuously learning from past observations. We consider two network settings: with and without central coordination. In the first case, the network nodes interact with each other through a centr…
Ankle sprains and instability are major public health concerns. Up to 70% of individuals do not fully recover from a single ankle sprain and eventually develop chronic ankle instability (CAI). The diagnosis of CAI has been mainly based on self-report rather than objective biomechanical measures. The goal of this study …
Bayesian system helps identify and thwart terrorist plans.
problem Identifying and thwarting terrorist plans before they occur.
method Develops a Bayesian decision support system to integrate member and group activities.
result Estimates the combined threat posed by a terrorist group.
Novel ML approach solves complex warehouse routing problem.
problem Efficiently routing pickers in mixed-shelves warehouses.
method Hierarchical and parallel multi-agent reinforcement learning.
result State-of-the-art performance in solution quality and inference speed.
Privileged Coordinates and Nilpotent Approximation for Carnot Manifolds, II. Carnot Coordinatesmath.DG
This paper is a sequel of arxiv:1709.09045 and deals with privileged coordinates and nilpotent approximation of Carnot manifolds. By a Carnot manifold it is meant a manifold equipped with a filtration by subbundles of the tangent bundle which is compatible with the Lie bracket of vector fields. In this paper, we single…
TOFU-POV tackles partially observed linear bandits, achieving sublinear regret with low-dimensional action vectors.
problem Stochastic linear bandits with partially observed actions in settings like recommendation and healthcare.
method TOFU-POV estimates latent action subspace, imputes missing actions, and runs OFUL in low-dimensional coordinates.
result TOFU-POV achieves regret scaling with intrinsic subspace dimension, improving upon natural baselines.
Paper certifies intersection of minimum-volume confidence sets for multinomial outcomes.
problem Certifying intersection of minimum-volume confidence sets for multinomial outcomes.
method Exploits likelihood ordering to induce halfspace constraints, enabling adaptive geometric partitioning and computable bounds on p-values.
result Efficient and provably sound algorithm for certifying intersection, disjointness, or indeterminate result.
A new method for multi-agent planning on graphs outperforms existing approaches.
problem Planning coordination among multiple interacting agents on a graph.
method Variational perturbation theory applied to inference in large networks.
result Our method outperforms state-of-the-art methods in non-local cost function scenarios.
New findings on Kähler manifolds restrict orthogonal coordinates existence.
problem Existence of orthogonal coordinates on Kähler manifolds.
method Algebraic and geometric techniques applied to Kähler manifolds.
result No nontrivial self-dual Kähler 4-manifolds or Ricci-flat Kähler 4-manifolds support orthogonal coordinates.
Defines Fenchel-Nielsen coordinates for SL(3,C) representations.
problem No specific problem stated; coordinates defined for a new context.
method Introduced Fenchel-Nielsen coordinates for representations.
result Relates to classical and generalized Fenchel-Nielsen coordinates.
Submanifolds of coordinate finite-type were introduced in HV1. A submanifold of a Euclidean space is called a coordinate finite-type submanifold if its coordinate functions are eigenfunctions of Δ. In the present study we consider coordinate finite-type surfaces in E^4. We give necessary and sufficient conditions for g…
We consider complex Fenchel-Nielsen coordinates on the quasi-Fuchsian space of punctured tori. These coordinates arise from a generalisation of Kra's plumbing construction and are related to earthquakes on Teichmueller space. They also allow us to interpolate between two coordinate systems on Teichmueller space, namely…
Proposes an active RBI framework using Rényi information measures for more informed decision-making.
problem Optimal latent variable estimates in real-time settings with streaming noisy observations.
method Unified inference and query selection steps through Rényi entropy and α-divergence; new objective called Momentum for exploration.
result Analytically demonstrates superior performance compared to conventional methods like mutual information.
Resource scheduling and coordination is an NP-hard optimization requiring an efficient allocation of agents to a set of tasks with upper- and lower bound temporal and resource constraints. Due to the large-scale and dynamic nature of resource coordination in hospitals and factories, human domain experts manually plan a…
The Dynnikov coordinate system puts global coordinates on the boundary of Teichmüller space of an --punctured disk. We survey the Dynnikov coordinate system, and investigate how we use this coordinate system to study pseudo--Anosov braids making use of results from Thurston's theory on surface homeomorphisms.
Method constructs orthogonal curvilinear coordinates in constant curvature spaces.
problem Creating orthogonal coordinates in spaces of constant curvature.
method Modification of Krichever's method for Euclidean space, applied to constant curvature spaces.
result Examples of orthogonal coordinate systems on the sphere and hyperbolic plane constructed.
In a previous paper, we parametrized boundary-unipotent representations of a 3-manifold group into SL(n,C) using Ptolemy coordinates, which were inspired by A-coordinates on higher Teichmüller space due to Fock and Goncharov. In this paper, we parametrize representations into PGL(n,C) using shape coordinates which are …