Paper analyzes Hit-and-Run's convergence rates and applies similar methods to randomized Kaczmarz.
problem Quantifying advantages of Hit-and-Run's coordinate-free property.
method Sharp estimates via coupling methods and mixing time bounds.
result Ballistic and superdiffusive convergence rates in certain settings.
Gibbs sampler mixes quickly for certain smooth distributions.
problem Drawing samples from log-smooth log-concave distributions.
method Analyzes Gibbs sampler on log-smooth and strongly log-concave distributions.
result Gibbs sampler mixes in O⋆(κ2n7.5) steps. Efficiently implements polar slice sampling for high-dimensional distributions.
problem Sampling from difficult-to-implement distributions in high dimensions.
method Separates directional and radial components for efficient implementation.
result Outperforms related methods in various settings.
Determinantal point processes (DPPs) are distributions over sets of items that model diversity using kernels. Their applications in machine learning include summary extraction and recommendation systems. Yet, the cost of sampling from a DPP is prohibitive in large-scale applications, which has triggered an effort towar…
Random feature maps improve forecasting with cheaper computation.
problem Improving forecasting accuracy with random feature maps.
method Developed a hit-and-run algorithm to select optimal internal weights.
result Optimal internal weights lead to superior forecasting skill.
New algorithms for interactive learning match minimax bounds efficiently.
problem Interactive learning in the realizable setting with computational efficiency.
method General framework, computationally efficient algorithms, Monte Carlo hit-and-run sampling.
result Sample complexities quantifiable in terms of combinatorial quantities, computationally efficient.
We report on results concerning a partially aggregated Stock Flow Consistent (SFC) macroeconomic model in the stationary state where the sectors of banks and firms are aggregated, the sector of households is dis-aggregated, and the probability density function (pdf) of the wealth of households is exogenous, constrained…
Improved Thompson Sampling outperforms existing Bayesian optimization methods.
problem Thompson Sampling's performance in Bayesian optimization is suboptimal compared to other methods.
method Developed Stagger Thompson Sampler (STS), which more precisely samples the optimal arm with less computation.
result STS outperforms TS, PSS, and other acquisition methods in various optimization tasks.
TML package uses tropical geometry for machine learning tasks.
problem Statistical learning problems.
method Tropical convexity computations, Hit and Run sampler, tropical metrics.
result First R package for tropical geometric machine learning.
Nested Slice Sampling accelerates Nested Sampling for GPU acceleration.
problem Challenging inference for complex, multimodal targets.
method Vectorized Nested Slice Sampling using Hit-and-Run Slice Sampling.
result NSS maintains accurate evidence estimates and high-quality posterior samples, robust on multimodal problems.
Random feature maps improve forecasting of chaotic dynamical systems.
problem Forecasting chaotic dynamical systems with high accuracy.
method Data-driven random feature maps with tanh activation, skip connections, and localization.
result Effective forecasting skill for dynamical systems with dimensions up to 512.
Gibbs sampler contracts entropy under strong log-concavity, improving mixing time.
problem Improving the mixing time of Gibbs sampler under strong log-concavity.
method Analyzing Gibbs sampler contraction under strong log-concavity, providing sharp contraction rate.
result Gibbs sampler contracts entropy linearly with condition number and independent of dimension under strong log-concavity.
Algorithm samples composite logconcave densities efficiently.
problem Sampling from composite logconcave densities efficiently.
method Uses a restricted Gaussian oracle and gradient queries.
result Achieves strong total variation distance guarantees.
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…
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…
Faster algorithm for sampling logconcave densities in high dimensions.
problem Cubic barrier in sampling logconcave densities from a cold start.
method Two key ingredients: weaker distance sampling and refined log-Sobolev inequality.
result First sub-cubic sampling algorithms for isotropic position.
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 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…
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…
The Dynnikov coordinate system puts global coordinates on the boundary of Teichmüller space of an n--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 …
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.
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.
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…
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.
If one could assume that local coordinates in a Riemannian manifold were orthogonal, then local expressions for differential operators, and curvature computations, would be simplified. It is always possible on 2-manifolds, using geometric normal coordinates or isothermal coordinates. In 1984, Dennis DeTurck and Dean Ya…
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.
Develops DP-SCD for stochastic coordinate descent, making it differentially private.
problem Privacy leak in auxiliary information during stochastic coordinate descent training.
method Develops DP-SCD, leveraging independent noise addition and decoupling/parallelizing coordinate updates.
result Demonstrates competitive performance against DP-SGD with less tuning.
Carnot groups can be polarized if they have specific coordinate systems.
problem Understanding when Carnot groups can be polarized.
method Proving Carnot groups with certain coordinate systems are polarizable.
result Carnot groups with suitable horizontal polar coordinates are polarizable.
It is shown that, in four dimensions, it is possible to introduce coordinates so that an analytic metric locally takes block diagonal form. i.e. one can find coordinates such that gαβ=0 for (α,β)∈S where S=(1,3),(1,4),(2,3),(2,4). We call a coordinate system in which the metric takes this for…
Robustly computes intrinsic coordinates on point clouds using resampling and averaging.
problem Computing intrinsic coordinates on noisy or outlier-prone point clouds.
method Subsample data, vary hyperparameters, cluster candidate embeddings, identify representative embeddings, and average them using Procrustes analysis.
result Robust to noise and outliers, validated on synthetic and real data.