TarMAC targets and coordinates multi-agent communication for cooperative tasks.
problem Coordinating multi-agent reinforcement learning in partially observable environments.
method Targeted multi-round communication approach without supervision.
result Improved performance and sample efficiency in diverse environments.
This work investigates how multi-round reasoning improves LLM performance.
problem Improving problem-solving abilities in complex tasks with LLMs.
method Investigates approximation, learnability, and generalization properties of multi-round auto-regressive models.
result Transformers with finite context windows are universal approximators for Turing-computable functions and can approximate any Turing-computable sequence-to-sequence function through multi-round reasoning.
Improved self-distillation reduces label noise and enhances model accuracy.
problem Label noise in multi-class classification.
method Label averaging and refined partial labels.
result Single-round self-distillation achieves comparable performance to multi-round distillation.
Reciprocating interactions represent a central feature of all human exchanges. They have been the target of various recent experiments, with healthy participants and psychiatric populations engaging as dyads in multi-round exchanges such as a repeated trust task. Behaviour in such exchanges involves complexities relate…
Develops methods to learn centre groupings from summary statistics in multi-centre studies.
problem Violation of homogeneity of parameters across centres in multi-centre studies.
method Clusters-of-Centres (CoC) algorithm that merges centres based on multivariate Cochran-type tests.
result Golden-partition recovery as the number of rounds grows with sample size.
Mechanism designs for unknown agent values in stochastic bandit settings.
problem Designing truthful mechanisms for maximizing social welfare in settings with unknown agent values and stochastic feedback.
method Developed a VCG-like mechanism with regret bounds for multi-round allocations, balancing agent and seller welfare.
result Achieved an $Ω(T^{ rac{2}{3}})$ lower bound for the maximum of welfare, agent utilities, and mechanism utility after T rounds. Study explores how to efficiently explore communities with limited budget.
problem Maximizing the number of members met with limited budget in community exploration.
method Systematic study from offline optimization to online learning, including greedy methods and upper confidence algorithms.
result Achieved logarithmic and constant regret bounds in online learning setting.
SAFLe solves federated learning's trade-off between non-linearity and scalability.
problem Federated Learning's high communication overhead and performance collapse on non-IID data.
method SAFLe introduces a structured head of bucketed features and sparse, grouped embeddings, mathematically equivalent to a high-dimensional linear regression.
result SAFLe achieves a new state-of-the-art in analytic FL, outperforming linear AFL and multi-round DeepAFL.
This paper analyzes Local SGD for federated learning, achieving both statistical and communication efficiency.
problem Statistical estimation and inference in federated learning with decentralized data.
method Local SGD, a multi-round estimation procedure using intermittent communication.
result Local SGD achieves both statistical efficiency and communication efficiency.
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…
Optimizes financial decisions with illiquid assets using Kelly criterion.
problem Determining optimal betting strategies in games with external capital constraints.
method Dynamic programming and WKB approximation for multi-round games; Kelly criterion for single-round games.
result Rational players adjust their risk-taking based on the proportion of their capital locked away.
Proposes Fusion Recurrent Neural Network for sequence data.
problem Improving sequence learning for practical applications.
method Fusion module and Transport module for sequence data.
result Fusion RNN performs comparably to state-of-the-art RNNs.
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…
New framework assesses LLM security risks in BFSI.
problem Lack of domain-specific security evaluation for LLMs in BFSI.
method Risk-aware evaluation framework combining taxonomy, automated red-teaming, and ensemble judging.
result Higher decoding stochasticity and adaptive interaction lead to more severe disclosures.
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.
We study the tradeoff between the statistical error and communication cost of distributed statistical estimation problems in high dimensions. In the distributed sparse Gaussian mean estimation problem, each of the m machines receives n data points from a d-dimensional Gaussian distribution with unknown mean θ w…
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 mSL(3,C) 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…
Game theory models incentivizes honesty in collaborative learning among competitors.
problem Incentivizing honest updates among competitors in collaborative learning schemes.
method Formulated a game to model interactions, studied two learning tasks, proposed mechanisms to incentivize honest communication.
result Rational clients are incentivized to manipulate their updates, preventing learning; proposed mechanisms ensure comparable learning quality to full cooperation.
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…
Dynnikov system maps Teichmüller space boundary, aiding pseudo-Anosov braid study.
problem Global coordinates on Teichmüller space boundary.
method Dynnikov coordinate system applied to pseudo-Anosov braids.
result Effective study of pseudo-Anosov braids via Thurston's theory.
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.
Paper develops a distributed debiased estimator for sparse statistical inference.
problem High computational costs in debiased estimator construction for high-dimensional models.
method Develops a multi-round distributed debiased estimator using both labeled and unlabelled data.
result Unlabeled data improves statistical rate of each iteration in distributed setup.
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 …
Study on conformal harmonic coordinates on manifolds, proving existence and properties.
problem Existence and properties of conformal harmonic coordinates on Riemannian manifolds.
method Solutions to the conformal Laplace equation, proving up to boundary regularity results, elliptic regularity, and unique continuation results.
result Proves conformal harmonic coordinates are a close conformal analogue of harmonic coordinates.
Symplectic coordinates found on a Hitchin component for a hyperbolic surface.
problem Parametrizing the PSL3(R)-Hitchin component with canonical coordinates. method Proved global Darboux coordinates with half canonical Goldman coordinates.
result Global Darboux coordinates exist for the PSL3(R)-Hitchin component. The paper develops efficient estimators for semi-parametric binary models in distributed computing.
problem Estimation and inference challenges in large-scale data under non-smooth objective functions.
method Proposes one-shot and multi-round divide-and-conquer estimators with adaptive kernel smoothing to relax constraints and achieve superlinear optimization error.
result Establishes quadratic convergence up to optimal statistical error rate and handles dataset heterogeneity and high-dimensional sparse parameters.
Accelerates coordinate descent methods for machine learning problems.
problem Slowness of coordinate descent methods in machine learning.
method Extrapolation-based accelerated coordinate descent.
result Significant speed-up in practice compared to existing methods.
We construct a tangent bundle exponential map and locally autoparallel coordinates for geometries based on a general connection on the tangent bundle of a manifold. As concrete application we use these new coordinates for Finslerian geometries and obtain Finslerian geodesic coordinates. They generalise normal coordinat…
Invariants of braids found using shear coordinates in hyperbolic geometry.
problem Finding invariants of braids.
method Using shear coordinates in hyperbolic geometry.
result Developed a method for calculating braids invariants.
Extends Dynnikov coordinates to punctured torus.
problem No specific problem stated; extending coordinates.
method Generalized Dynnikov coordinate system to punctured torus.
result Coordinates defined on punctured torus.
We study the limiting case of the Krichever construction of orthogonal curvilinear coordinate systems when the spectral curve becomes singular. We show that the case when the curve is reducible and all its irreducible components are rational curves the construction procedure reduces to solving systems of linear equatio…
Normalizes pseudo-Einstein contact forms for easier analysis.
problem Understanding pseudo-Einstein contact forms.
method Constructing intrinsic CR normal coordinates using parabolic normal coordinates.
result Normal form for pseudo-Einstein contact forms.
DP-SGD can update fewer coordinates while maintaining privacy.
problem How to update fewer coordinates in DP-SGD without losing optimization signal.
method TP-TopK (Two-Phase TopK DP-SGD), a two-phase method for coordinate-sparse private training.
result Private training can update fewer coordinates without losing optimization signal, scaling noise with active dimension \(k\) instead of full dimension \(d\).
Novel deep learning method predicts reaction coordinates and future MD trajectories.
problem Identifying optimal reaction coordinates for chemical reactions.
method Regularized Sparse Autoencoder (RSE) for discovering reaction coordinates and predicting MD trajectory evolution.
result RSE helps in choosing a small but important set of reaction coordinates.
Despite being studied for over a century, the use of quadrupoles have been limited to Cartesian coordinates in flat spacetime due to the incorrect transformation rules used to define them. Here the correct transformation rules are derived, which are particularly unusual as they involve second derivatives of the coordin…
The study examines the regularity of branched immersions using special coordinate systems.
problem Understanding the regularity of branched immersions and their fundamental elements.
method Development and use of special coordinate systems to express maps with branch points, proving existence and regularity conditions for mean curvature vectors.
result Characterization and existence of special coordinate systems for branch immersions, proving regularity conditions for mean curvature vectors.
This monograph presents a class of algorithms called coordinate descent algorithms for mathematicians, statisticians, and engineers outside the field of optimization. This particular class of algorithms has recently gained popularity due to their effectiveness in solving large-scale optimization problems in machine lea…
This study develops methods to coordinate travel routes to reduce congestion.
problem Coordination of travel routes to reduce urban traffic congestion.
method Developed mathematical approaches to quantify coordination potential and adaptive centroid-based clustering algorithm (ACCA).
result ACCA efficiently forms proper coordination groups for CB-CRM, improving efficiency with minimal performance loss.
Flat coordinates found for algebraic Frobenius manifolds in low dimensions.
problem Understanding algebraic Frobenius manifolds in small dimensions.
method Using reflection representations of finite Coxeter groups, finding flat coordinates of the Frobenius metric.
result Explicit relations between flat coordinates of the Frobenius metric and intersection form for most known examples up to dimension 4.
The article proves Kähler 4-manifolds can only be products of 2 surfaces.
problem Finding orthogonal coordinates on Kähler manifolds.
method Using geometric and algebraic methods to construct orthogonal coordinates.
result Only Kähler 4-manifolds can be products of 2 surfaces.
This paper constructs a family of coordinate systems about a point on a quaternionic contact manifold, called quaternionic contact pseudohermitian normal coordinates. Once defined, conformal variations of the quaternionic contact structure induce changes on the coordinates which are studied in an effort to simplify the…
Given a finite collection of C1 vector fields on a C2 manifold which span the tangent space at every point, we consider the question of when there is locally a coordinate system in which these vector fields are real analytic. We give necessary and sufficient, coordinate-free conditions for the existence of such a…
QuantaAlpha uses evolutionary algorithms to mine financial alpha robustly across market distributions.
problem Challenges in alpha mining due to market noise and regime shifts.
method Evolutionary framework treating each mining run as a trajectory, mutation, crossover, targeted revision, and reuse of effective patterns.
result Consistent gains over strong baselines and prior systems, achieving high IC and ARR.
We find necessary and sufficient conditions under which the complex coordinates on a flag manifold of a classical group described in [2] are Bochner coordinates.
Study uses Dynnikov coordinates to analyze actions of Dehn twists on a thrice-punctured disc.
problem Analyzing actions of Dehn twists in geometric group theory.
method Application of Dynnikov coordinates to describe orbits and dynamics of Dehn twists in a thrice-punctured disc.
result The action of Dehn twists has a geometric meaning as a piecewise linear Z2-automorphism. Constructs coordinate systems from spectral curve sheaves.
problem Creating coordinate systems from spectral curve sheaves.
method Finite-gap integration methods for orthogonal curvilinear coordinates.
result Constructs coordinate systems over reducible spectral curves.
Study curvature and torsion in Gaussian distribution's dual coordinate system.
problem Characterize geometric invariants of Gaussian distribution.
method Investigate Riemannian curvature and torsion in a dual coordinate system of Gaussian distribution.
result Explicitly give Amari formulas in the new coordinate system.