Reinforcement learning improves wireless systems' rate adaptation.
problem Optimizing rate adaptation in 4G/5G systems using ACK/NACK feedback.
method Formulated as a Multi-Armed Bandit problem, proposed binary search algorithm with PAC guarantees.
result Achieved PAC solution for OLLA with binary search, outperforming UCB methods.
ANIL adapts only a subset of parameters, reducing computational cost.
problem Efficiently adapt model parameters in meta-learning.
method Adapts only a small subset of parameters in the inner loop of ANIL.
result Theoretical convergence and computational complexity analysis for ANIL.
Two adaptive kernel selection methods improve the accuracy of Kernelized Diffusion Maps.
problem Selecting an appropriate kernel for Kernelized Diffusion Maps.
method Two complementary approaches: variational outer loop and unsupervised cross-validation.
result Both methods improve the quality and stability of the recovered eigenfunctions.
PDA method optimizes neural networks with global convergence rate analysis.
problem Quantitative convergence rate for neural network optimization in mean field regime.
method Particle dual averaging (PDA) method, combining Langevin algorithm and outer loop optimization.
result Established quantitative global convergence for two-layer mean field neural networks.
We consider the existence of bibundles, in other words locally trivial principal G spaces with commuting left and right G actions. We show that their existence is closely related to the structure of the group $\Out(G)$ of outer automorphisms of G. We also develop a classifying theory for bibundles. The theory is …
A new method for efficient nested Monte Carlo simulations in financial modeling.
problem Computational challenges in nested stochastic modeling for financial risk assessment.
method Sample recycling approach to speed up inner loop estimations.
result Significantly more efficient than traditional techniques.
Loopless SVRG and Katyusha methods outperform their counterparts in practical applications.
problem Training supervised machine learning models efficiently.
method Designing loopless variants of SVRG and Katyusha methods.
result Loopless variants of SVRG and Katyusha have superior practical behavior.
Study convexity of geodesics and balls in Outer space.
problem Convexity properties of geodesics and balls in Outer space.
method Introduced balanced folding paths and used them to show weak convexity of out-going balls.
result Weak convexity of out-going balls in Outer space.
New optimization problem for graph and hypergraph learning tasks.
problem Learning tasks on graphs and hypergraphs.
method Quadratic decomposable submodular function minimization (QDSFM) via dual strategy and double-loop algorithms.
result Linear convergence rates for outer-loop optimization and effective hypergraph-based PageRank algorithm.
RSGDA improves convergence rates for nonconvex-strongly concave optimization.
problem Optimization of nonconvex-strongly concave problems.
method Randomized Stochastic Gradient Descent Ascent (RSGDA) with optimal loop sizes.
result First almost sure convergence rates for SGDA algorithms on nonconvex-strongly concave settings.
Study shows infinite distinct outer metric Lipschitz classes for knots in S3.
problem Lipschitz classification of surface singularities in R4. method Outer metric Lipschitz equivalence and topological equivalence of knots.
result Infinitely many distinct outer metric Lipschitz classes for knots in S3. NeAda solves nonconvex minimax optimization by balancing primal and dual variables adaptively.
problem Nonconvex minimax optimization challenges with parameter-agnostic adaptive algorithms.
method Nested Adaptive (NeAda) framework with inner and outer loops for primal and dual variables.
result Achieves near-optimal convergence rates for nonconvex-strongly-concave problems.
A graph G is intrinsically S^1-linked if for every embedding of the vertices of G into S^1, vertices that form the endpoints of two disjoint edges in G form a non-split link in the embedding. We show that a graph is intrinsically S^1-linked if and only if it is not outer-planar. A graph is outer-flat if it can be embed…
Efficient hybrid method for pricing barrier options with stochastic volatility.
problem Valuation of barrier options on assets with stochastic volatility.
method Combining Monte Carlo simulation and semi-analytical heat potential method.
result Our method provides better accuracy and is orders of magnitude faster than existing methods.
Meta-learning curiosity algorithms improves exploration across various tasks.
problem Generating curious behavior in reinforcement learning.
method Meta-learning approach to adapt reward signals dynamically.
result Two novel curiosity algorithms outperform human-designed ones.
New geometric methods solve a conjecture for hyperbolic 3-manifolds.
problem Verifying the 1-loop conjecture for hyperbolic 3-manifolds.
method Constructing geometric ideal triangulations and solving gluing equations.
result Proves the 1-loop conjecture for a large class of hyperbolic 3-manifolds.
The purpose of this note is to announce complete answers to the following questions. (1) For an essential simple loop on a 2-bridge sphere in a 2-bridge link complement, when is it null-homotopic in the link complement? (2) For two distinct essential simple loops on a 2-bridge sphere in a 2-bridge link complement, when…
Designs a Cellular Automata rule for forming touching loop patterns.
problem Forming stable touching loop patterns in a 2D grid.
method Developed a Cellular Automata rule that uses templates to cover the space and match patterns.
result The rule successfully evolves stable touching loop patterns in a 2D grid.
We give a complete characterization of those essential simple loops on 2-bridge spheres of 2-bridge links which are null-homotopic in the link complements. By using this result, we describe all upper-meridian-pair-preserving epimorphisms between 2-bridge link groups.
In this paper and its prequel, we give a necessary and sufficient condition for two essential simple loops on a 2-bridge sphere in an even Heckoid orbifold for a 2-bridge link to be homotopic in the orbifold. We also give a necessary and sufficient condition for an essential simple loop on a 2-bridge sphere in an even …
In this paper and its sequel, we give a necessary and sufficient condition for two essential simple loops on a 2-bridge sphere in an even Heckoid orbifold for a 2-bridge link to be homotopic in the orbifold. We also give a necessary and sufficient condition for an essential simple loop on a 2-bridge sphere in an even H…
Introduces string structures linking to loop spaces.
problem Understanding geometric string structures.
method Explains connections to loop spaces.
result String structures linked to loop spaces.
We solve the Plateau problem for marginally outer trapped surfaces in general Cauchy data sets. We employ the Perron method and tools from geometric measure theory to force and control a blow-up of Jang's equation. Substantial new geometric insights regarding the lower order properties of marginally outer trapped surfa…
End-to-end meta-learned system for image compression.
problem Reducing the gap between training and inference conditions in image compression.
method Model-Agnostic Meta-learning approach for latent tensor overfitting and updating encoder and decoder networks.
result Meta-learned system achieves better compression performance compared to traditional methods.
This work analyzes how often to update the target network in Q-learning.
problem Understanding the optimal frequency of target network updates in Q-learning.
method Formulated target updates as a nested optimization scheme, derived finite-time convergence analysis.
result Optimal target update frequency increases geometrically over time.
In this paper and its two sequels, we give a necessary and sufficient condition for two essential simple loops on a 2-bridge sphere in a 2-bridge link complement to be homotopic in the link complement. This paper treats the case when the 2-bridge link is a (2,p)-torus link, where more cases of homotopy arise, and its…
This paper analyzes the impact of loops on bilevel optimization efficiency.
problem The impact of loops on the efficiency of bilevel optimization algorithms.
method Unified convergence analysis and computational complexity characterization for AID-BiO and ITD-BiO with and without loops.
result Loops in bilevel optimization can improve overall efficiency but increase per-step complexity.
Superconducting circuit technologies have recently achieved quantum protocols involving closed feedback loops. Quantum artificial intelligence and quantum machine learning are emerging fields inside quantum technologies which may enable quantum devices to acquire information from the outer world and improve themselves …
Paper improves SDR estimation speed and conditions.
problem Improving sufficient dimension reduction for multi-index models.
method Estimating expected smoothed gradient outer product.
result Achieves fast parametric convergence rate of Cd⋅n−1/2. Study loop ensembles on graphs, linking group theory and topology.
problem Understanding loop homotopy classes and homologies on graphs.
method Determined distributions of loop homotopy classes and homologies using the lower central series of the fundamental group.
result Distributions of loop homotopy classes and homologies defined by the lower central series of the fundamental group.
Paper studies geometric and combinatorial properties of circular snakes.
problem Exploring geometric and combinatorial properties of circular snakes.
method Definition and investigation of outer Lipschitz geometry, decomposition of Valette link, construction of combinatorial objects, weakly outer Lipschitz classification.
result Existence of canonical decomposition and necessary/sufficient criteria for removing segments or Hölder triangles.
A new Markov theorem for 4D ribbon torus-links.
problem Describing isotopic links in R4. method Develops a theorem for ribbon torus-links in B3imesS1. result First step towards a 4D Markov theorem.
Develops new methods to evaluate data influence in SAM for improved model training.
problem Challenges in mislabeled noisy data and privacy concerns in SAM.
method Two innovative data valuation methods based on influence functions (IF) for SAM.
result Demonstrates effectiveness in identifying mislabeled data and enhancing interpretability.
This is the second of a series of papers which give a necessary and sufficient condition for two essential simple loops on a 2-bridge sphere in a 2-bridge link complement to be homotopic in the link complement. The first paper of the series treated the case of the 2-bridge torus links. In this paper, we treat the case …
Formula for transgressions on polyhedral manifolds, linking face volumes and outer angles.
problem Computing topological invariants of polyhedral manifolds.
method Defining transgressions for Pfaffian of metric connections and applying to polyhedral manifolds.
result Derivation of an identity linking face volumes and outer angles of spherical and hyperbolic polyhedra.
We derive integral and sup-estimates for the curvature of stably marginally outer trapped surfaces in a sliced space-time. The estimates bound the shear of a marginally outer trapped surface in terms of the intrinsic and extrinsic curvature of a slice containing the surface. These estimates are well adapted to situatio…
Study links between surface germs and knot theory in 4D.
problem Understanding the relationship between surface germs and knot theory in R4. method Constructing surface germs XK linked to knots K in S3 and studying their Lipschitz geometry. result Ambient bi-Lipschitz equivalence of surface germs is related to isotopy of knots, and Jones polynomial can recognize non-equivalent germs.
Develops implicit MAML for efficient few-shot learning.
problem Efficient few-shot learning with limited data.
method Implicit differentiation for inner loop optimization.
result Agrees with inner loop optimizer choice and handles many gradient steps.
Simplicial versions of topological abelian gauge theories are constructed which reproduce the continuum expressions for the partition function and Wilson expectation value of linked loops, expressible in terms of R-torsion and linking numbers respectively. The new feature which makes this possible is the introduction o…
New invariant detects non-homeomorphic arrangements with similar coefficients.
problem Detecting non-homeomorphic arrangements with similar coefficients.
method Loop linking number, braid monodromy, and Rybnikov's arrangements.
result Fundamental groups of complements are not isomorphic.
In this paper, we present a unified study of the moduli space of tropical curves and Outer space which we link via period maps to the moduli space of tropical abelian varieties and the space of positive definite quadratic forms. Our work is a first step towards exhibiting Outer space and the space of positive definite …
QuantAgent learns trading signals through self-improvement.
problem Building domain-specific knowledge for LLMs in quantitative investment.
method Two-layer loop approach: inner loop refines responses, outer loop tests and learns.
result QuantAgent approximates optimal trading behavior with provable efficiency.
This is the last of a series of papers which give a necessary and sufficient condition for two essential simple loops on a 2-bridge sphere in a 2-bridge link complement to be homotopic in the link complement. The first paper of the series treated the case of the 2-bridge torus links, and the second paper treated the ca…
Defines different ways to describe knotted loops.
problem Characterizing knotted loops.
method Various characterizations of framed links.
result Foundational account of link descriptions.
Homology of torus knots stabilizes to loop space homology.
problem Computing homology of complex Grassmannians and torus knots.
method Colored sl(N) homology and free loop space computation. result Khovanov homology of torus knots stabilizes to loop space homology.
Study Brownian loops on hyperbolic surfaces, linking to Selberg zeta function.
problem Understanding Brownian loops on hyperbolic surfaces and their relation to Selberg zeta function.
method Computed mass of loops and related to Selberg zeta function for geometrically finite surfaces.
result Relate total loop mass to Selberg zeta function, providing probabilistic interpretations of determinants.
We study the 2-loop part of the rational Kontsevich integral of a knot in an integer homology sphere. We give a general formula which explains how the 2-loop part of the Kontsevich integral of a knot changes after surgery on a single clasper whose leaves are not linked to the knot. As an application, we relate this for…
The total homology of the loop space of the configuration space of ordered distinct n points in R^m has a structure of a Hopf algebra defined by the 4-term relations if m>2. We describe a relation of between the cohomology of this loop space and the set of finite type invariants for the pure braid group with n strands.…