Optimal unimodal fitting for linear loss functions in a sequential, efficient manner.
problem Optimal unimodal transformation of univariate model scores under linear loss functions.
method Proposes a sequential approach to estimate the optimal rectangular fit for observed samples with each new sample.
result Sequential approach achieves optimal efficiency with logarithmic time complexity per iteration.
Logarithmic-time schedules boost large-scale language model training efficiency.
problem Improving performance and efficiency in large-scale language model training.
method Designing time-varying hyperparameters ( β 1 , β 2 , λ ) (β_1, β_2, λ) ( β 1 , β 2 , λ ) for AdamW, specifically logarithmic-time scheduling with damping mechanisms. result ADANA optimizer achieves up to 40% compute efficiency compared to tuned AdamW, with gains persisting as model scale increases.
CMT efficiently manages memory by inserting and querying memories in logarithmic time.
problem Managing large memory stores efficiently for quick access and updates.
method Designing a Contextual Memory Tree (CMT) that inserts and retrieves memories in logarithmic time.
result CMT improves classification algorithms and image-captioning tasks, demonstrating better computational efficiency.
This paper tackles reinforcement learning in large action spaces, presenting a method that embeds actions in a continuous space and uses approximate nearest-neighbor methods.
problem Current reinforcement learning methods struggle with environments having large numbers of discrete actions, making them inapplicable to many real-world tasks.
method The approach embeds actions in a continuous space and uses approximate nearest-neighbor methods for efficient training.
result The proposed method enables reinforcement learning to be applied to large-scale learning problems previously intractable with current methods.
New binary approach for multiclass classification scales logarithmically with classes.
problem Efficient multiclass classification for large number of classes.
method Proves a boosting theorem and translates it into an algorithm.
result Exponential speed improvements for large number of classes.
Efficient graph-based decoding improves extreme classification accuracy.
problem Learning algorithms for extreme classification with large label sets.
method ECOC with loss-based decoding on graph-induced output codes.
result Efficient loss-based decoding on graph output codes improves classification accuracy.
Quantum computing speeds up training Gaussian processes exponentially.
problem Training Gaussian processes efficiently.
method Quantum algorithms for computing the logarithm of the determinant and matrix inversion.
result Exponential improvement in estimating the marginal likelihood of Gaussian processes.
Optimal algorithms for mixable losses in dynamic environments with reduced redundancy.
problem Online optimization of mixable loss functions in a dynamic environment.
method Introduce online mixture schemes with polynomial and logarithmic time complexities.
result Achieves optimal redundancy up to a constant multiplicity gap.
Online change detection algorithm using random Fourier features.
problem Online non-parametric change point detection in multivariate data streams.
method Sequential testing procedure based on random Fourier features.
result The algorithm has optimal detection delay in the minimax sense.
Algorithm optimizes quantized isotonic regression with log-linear time updates.
problem Optimizing quantized isotonic regression estimations.
method Modified PAVA algorithm for sequential optimization.
result Log-linear time updates for optimal quantized mapping.
Enumerating all 3-manifold triangulations of a given size is a difficult but increasingly important problem in computational topology. A key difficulty for enumeration algorithms is that most combinatorial triangulations must be discarded because they do not represent topological 3-manifolds. In this paper we show how …
Oracle-efficient algorithms reduce combinatorial semi-bandit regret to logarithmic time.
problem Scalability issue in combinatorial semi-bandit problems due to high combinatorial optimization costs.
method Oracle-efficient frameworks that minimize oracle queries while maintaining tight regret guarantees.
result Achieved i l d e O ( T ) ilde{O}(\sqrt{T}) i l d e O ( T ) regret with O ( log log T ) O(\log\log T) O ( log log T ) oracle queries for worst-case linear rewards. Classical algorithms approximate quantum dynamics using subsampling.
problem Simulating quantum mechanical systems efficiently on classical computers.
method Randomized numerical linear algebra and the Nyström method for approximating matrix exponentials.
result Classical algorithms can efficiently simulate quantum computations under specific conditions.
Study shows polynomial-width neural networks can closely approximate infinite-width networks in polynomial time.
problem Approximating dynamics of polynomial-width neural networks with infinite-width networks.
method Bounding approximation gap through a differential equation governed by mean-field dynamics, considering local Hessian.
result Polynomially many neurons are sufficient to closely approximate mean-field dynamics.
Entropy tracking reveals class commitment transitions in diffusion models.
problem Diffusion models lack reliable methods to detect semantic structure transitions.
method Tracking class-conditional entropy of latent variables.
result Entropy isolates noise regimes critical for semantic structure formation.
E-LDA offers faster, interpretable LDA topic models.
problem Inferring topics in LDA topic models with strong guarantees.
method Non-gradient combinatorial approach for faster convergence.
result Logarithmic parallel computation time and interpretability.
Novel BSG method for efficient stochastic optimization.
problem Efficient optimization of non-convex surfaces in stochastic settings.
method Binary search combined with first order gradient optimization.
result BSG produces more promising results and better generalization than other methods.
pLSTM tackles long-range language modeling and computer vision tasks with parallelizable linear source transition mark networks.
problem Challenges of existing recurrent architectures in handling sequences and multi-dimensional data.
method Introduces pLSTM, a parallelizable linear source transition mark network for linear graphs and DAGs, addressing vanishing/exploding activation/gradient issues.
result pLSTM outperforms Transformers in long-range tasks like arrow-pointing extrapolation and image size extrapolation.
Study competition in OTC CDS market through CCP and interdealer choice models.
problem Analyze competition dynamics in OTC credit default swap market.
method Developed models for CCP choice and interdealer counterpart selection using semi-supervised learning and game theory.
result Introduced novel metrics and algorithms for understanding market dynamics.
Study on pricing options tied to stock tick complexity.
problem Pricing options based on stock tick complexity.
method Numerical and theoretical analysis of European and American options.
result Numerical and theoretical pricing results for different complexity types.
New condition prevents hyperbolic spaces from matching curve complexes.
problem Identifying when hyperbolic spaces cannot match curve complexes.
method Analyzing specific hyperbolic complexes and identifying a condition.
result Identified a condition preventing quasi-isometry between hyperbolic spaces and curve complexes.
Study on complex line fields on almost-complex manifolds, proving existence conditions.
problem Existence of linearly independent complex line fields on almost-complex manifolds.
method Prove necessary and sufficient conditions for the existence of one, two, or three fields over certain manifolds.
result Necessary and sufficient condition for the existence of complex line fields over certain manifolds.
Study complex deformations of compact complex surfaces in Calabi-Yau four-folds.
problem Explaining why complex and Cayley deformations of a compact complex surface are the same.
method Study complex deformations of compact complex submanifolds of Calabi-Yau manifolds.
result Prove that the moduli space of complex deformations of any compact complex embedded submanifold of a Calabi-Yau manifold is a smooth manifold.
Homotopy types of curve and arc complexes are studied.
problem Understanding the homotopy types of curve and arc complexes.
method Proving homotopy equivalence and contractibility of complexes.
result Fine curve complex is homotopy equivalent to curve complex, fine arc complex is contractible.
This research explores complex-valued neural networks and their implementation.
problem The challenges of implementing complex-valued neural networks and their potential for non-complex data.
method Detailed theory and implementation of CVNN, including Wirtinger calculus, complex backpropagation, and modules like complex layers and activation functions. Python implementation using cvnn toolbox.
result Demonstrates the potential of CVNN for non-complex data through simulations.
Paper introduces fat CW complexes including all closed manifolds.
problem No specific problem stated, focuses on introducing new CW complexes.
method Introduces a new smooth version of CW complexes called fat CW complexes.
result Fat CW complexes include all closed manifolds and have desirable properties.
The paper discusses q q q -deformations of the Aomoto complex.
problem Deformation of cochain complexes associated with hyperplane arrangements.
method Replaces entries of coboundary maps with q q q -analogues and analyzes the resulting structures. result The q q q -deformation can be a cochain complex under certain conditions and yields local system cohomology groups. The paper characterizes and analyzes complex Cartan spaces.
problem Characterizing and analyzing complex Cartan spaces.
method Characterizations, Legendre transformation, Hamilton-Jacobi equations, projective relations.
result Complex geodesic curves of complex Cartan spaces derive from Hamilton-Jacobi equations.
Study calculates global sections on complex curves.
problem Global sections of chiral de Rham complexes on complex curves.
method Calculation on closed complex curves with genus g ≥ 2.
result Space of global sections determined.
The paper studies lifts of complex structures on a manifold.
problem Understanding higher-order lifts of extended almost complex structures.
method Proved theorems on Nijenhuis tensor and introduced a new tensor field.
result Basic results on almost analytic complex vectors are investigated.
The paper defines and constructs almost complex blow-ups on 4D almost complex manifolds.
problem Existence and uniqueness of almost complex blow-ups on almost complex manifolds.
method Definition and construction of almost complex blow-ups, proving their existence and uniqueness.
result Existence and uniqueness of almost complex blow-ups on 4D almost complex manifolds.
Study L 2 L^2 L 2 Hilbert complexes on complex manifolds.
problem Analyse L 2 L^2 L 2 Hilbert complexes on complex manifolds. method Define and study L 2 L^2 L 2 Aeppli-Bott-Chern Hilbert complex; examine properties on various manifolds; use self-adjoint extensions of differential operators. result Kernels of operators on compact Hermitian manifolds are isomorphic to Aeppli or Bott-Chern cohomology.
Odd m-fold connected sums of complex projective spaces admit almost complex structures.
problem Existence of almost complex structures on connected sums of complex projective spaces.
method Analyzing the m-fold connected sum m # C P 2 n m\#\mathbb{C}\mathbb{P}^{2n} m # C P 2 n for m odd or even. result Only odd m-fold connected sums of complex projective spaces admit almost complex structures.
Research shows arc complex is not quasi-isometric to sphere complex.
problem Comparing quasi-isometry of arc complex and sphere complex.
method Simple proof of quasi-isometric rigidity of arc complex.
result Arc complex is not quasi-isometric to sphere complex.
Study Hodge-de Rham numbers for almost complex 4-manifolds, extending properties from complex surfaces.
problem Understanding Hodge-de Rham numbers for almost complex 4-manifolds.
method Introduced and studied Hodge-de Rham numbers, extending properties from complex surfaces.
result All Hodge-de Rham numbers for compact almost complex 4-manifolds are determined by the cohomology, except for one (the irregularity).
No complex analytic tori in complex deformations of Kummer varieties.
problem Existence of complex analytic tori in Kummer varieties.
method Proving non-existence through complex deformation analysis.
result Generic complex deformations of Kummer varieties contain no complex analytic tori.
Proposes a Complex Transformer for complex-valued sequence modeling.
problem Lack of deep learning models for complex-valued data.
method Develops a Complex Transformer using transformer backbone with specialized attention and encoder-decoder networks.
result Achieves state-of-the-art performance on complex-valued datasets.
New proofs for growth series of Coxeter groups using complex structures.
problem Proving new formulae for growth series of Coxeter groups.
method Using the structure of Coxeter complexes, Davis complexes, or Tits non-complexes.
result Several classical formulae for growth series are proved in a new way.
Unified complexity measure for learning theory improves risk bounds.
problem Improving risk bounds in learning theory for various estimators.
method Introduces a new complexity measure interpolating between Rademacher, KL-divergence, and NML complexities.
result Bounded excess risk in terms of the new complexity measure.
Method constructs complex symplectic Lie algebras from simpler ones.
problem Classifying complex symplectic Lie algebras of various dimensions.
method Complex symplectic oxidation method
result Classification of eight-dimensional nilpotent complex symplectic Lie algebras.
The paper constructs complex structures on hypersurfaces in hyperkahler manifolds.
problem No specific problem stated; focuses on construction of structures.
method Construction of complex metric structures on hypersurfaces in hyperkahler manifolds.
result The construction of complex structures on hypersurfaces in hyperkahler manifolds.
A Sasaki-like almost contact complex Riemannian manifold is defined as an almost contact complex Riemannian manifold which complex cone is a holomorphic complex Riemannian manifold. Explicit compact and non-compact examples are given. A canonical construction producing a Sasaki-like almost contact complex Riemannian ma…
New rational parallelisms found on complex manifolds that are not flat.
problem Finding non-flat rational parallelisms on complex manifolds.
method Examined rational parallelisms on compact complex manifolds, discovering non-flat examples.
result Discovered rational parallelisms on compact complex manifolds that are not flat.
New differential complexes on symplectic manifolds.
problem Developing calculus on symplectic manifolds.
method Coupling a symplectic manifold to a vector bundle with a constrained curvature.
result Construction of new differential complexes.
New model complexes help solve homology problems in 4D space.
problem Computing homology of 2-complexes in 4D space.
method Use model 2-complexes built from group presentations, showing linear embeddability.
result Homology computation is equivalent to matrix diagonalization in 4D space.
Study S p ( n ) Sp(n) S p ( n ) -orbits in complex and Σ Σ Σ -complex subspaces of Hermitian quaternionic vector spaces.
problem Characterize S p ( n ) Sp(n) S p ( n ) -orbits in Grassmannians of complex and Σ Σ Σ -complex subspaces. method Decompose subspaces into 4-dimensional complex addends and 2-dimensional totally complex subspace. Use properties of isoclinic subspaces and principal angles.
result Determine full set of invariants for S p ( n ) Sp(n) S p ( n ) -orbits in G r R ( 2 k , 4 n ) Gr^\R(2k,4n) G r R ( 2 k , 4 n ) . Study on invariant almost complex structures on real flag manifolds.
problem Existence of invariant almost complex structures on real flag manifolds.
method Analysis of real flag manifolds associated to split real forms of complex simple Lie algebras.
result Some real flag manifolds do not admit invariant almost complex structures.
Tree complex linked to polyhedral shapes like associahedra and cyclohedra.
problem Understanding the structure of mapping class groups and complex dynamics.
method Characterizing associahedra and cyclohedra using planar tree embeddings and barycentric subdivision.
result Tree complex is a barycentric subdivision of a polyhedral cell complex made of associahedra and cyclohedra.