Birkhoff interpolation framework for arbitrary derivative-availability patterns in local polynomial models, with poisedness conditions, accuracy bounds, and a trust-region algorithm evaluated on CUTEst problems.
Title resolution pending
10 Pith papers cite this work, alongside 2,216 external citations. Polarity classification is still indexing.
10
Pith papers citing it
2,216
external citations · OpenAlex
citation-role summary
background 2
method 1
citation-polarity summary
representative citing papers
Scalable IP formulations for optimal vertex elimination allow heuristic benchmarking on medium graphs and deliver a parameterized approximation algorithm plus first lower bounds.
ADELIA is the first AD-enabled INLA system that computes exact hyperparameter gradients via a structure-exploiting multi-GPU backward pass, delivering 4.2-7.9x per-gradient speedups and 5-8x better energy efficiency than finite differences on models with up to 1.9 million latent variables.
HIcosmo is a new JAX-based differentiable framework for background cosmology inference that matches Cobaya results while delivering 8.7x CPU and up to 20x GPU speedups.
LTBs-KAN delivers linear-time B-spline evaluation in KANs plus parameter reduction via product-of-sums factorization, with competitive results on MNIST, Fashion-MNIST, and CIFAR-10.
Prefix parsing is solved by a grammar transformation that turns it into standard parsing on a slightly larger grammar.
The volume of central diagonal hyperplane sections of the unit n-cube is strictly monotonically increasing in n for n ≥ 3.
AATS is an asynchronous Taylor integration framework for multi-rate DDEs that claims O(N) complexity, continuous convergence, and zero-allocation memory via static circular buffers.
Controlled benchmarks show per-step residual correction (A2C2) as most effective for VLA asynchronous inference up to d=8 delays on Kinetix with over 90% solve rate, outperforming inpainting and conditioning while training-based simulation is most robust.
PEPSKit.jl is a Julia package that supplies high-level algorithms for ground-state, time-evolution and finite-temperature iPEPS simulations with symmetry support on various lattices.
citing papers explorer
-
Birkhoff interpolation models for optimization with some available derivatives
Birkhoff interpolation framework for arbitrary derivative-availability patterns in local polynomial models, with poisedness conditions, accuracy bounds, and a trust-region algorithm evaluated on CUTEst problems.
-
A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation
Scalable IP formulations for optimal vertex elimination allow heuristic benchmarking on medium graphs and deliver a parameterized approximation algorithm plus first lower bounds.
-
ADELIA: Automatic Differentiation for Efficient Laplace Inference Approximations
ADELIA is the first AD-enabled INLA system that computes exact hyperparameter gradients via a structure-exploiting multi-GPU backward pass, delivering 4.2-7.9x per-gradient speedups and 5-8x better energy efficiency than finite differences on models with up to 1.9 million latent variables.
-
HIcosmo: a differentiable JAX-based framework for cosmology inference
HIcosmo is a new JAX-based differentiable framework for background cosmology inference that matches Cobaya results while delivering 8.7x CPU and up to 20x GPU speedups.
-
LTBs-KAN: Linear-Time B-splines Kolmogorov-Arnold Networks
LTBs-KAN delivers linear-time B-spline evaluation in KANs plus parameter reduction via product-of-sums factorization, with competitive results on MNIST, Fashion-MNIST, and CIFAR-10.
-
Prefix Parsing is Just Parsing
Prefix parsing is solved by a grammar transformation that turns it into standard parsing on a slightly larger grammar.
-
Central diagonal sections of the $n$-cube
The volume of central diagonal hyperplane sections of the unit n-cube is strictly monotonically increasing in n for n ≥ 3.
-
An Asynchronous multi-rate Taylor method for Delay Differential Equations
AATS is an asynchronous Taylor integration framework for multi-rate DDEs that claims O(N) complexity, continuous convergence, and zero-allocation memory via static circular buffers.
-
Understanding Asynchronous Inference Methods for Vision-Language-Action Models
Controlled benchmarks show per-step residual correction (A2C2) as most effective for VLA asynchronous inference up to d=8 delays on Kinetix with over 90% solve rate, outperforming inpainting and conditioning while training-based simulation is most robust.
-
PEPSKit.jl: A Julia package for projected entangled-pair state simulations
PEPSKit.jl is a Julia package that supplies high-level algorithms for ground-state, time-evolution and finite-temperature iPEPS simulations with symmetry support on various lattices.