The notion of friendliness between trees first appeared in solution of Lando's problem on intersection of polyhedra in 3-space. A tree is friendly to a path graph if edges of the tree can be numbered so that for each k,s the path between the edges k and k+1 contains either both or none of the edges k+2s,k+2s+1. Theorem…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “computational friendliness”
Paper speeds up large foundation models for time series data.
problem Resource-intensive foundation models limit accessibility.
method Dimensionality reduction techniques, including PCA and neural network adapters.
result Up to 10x speedup and 4.5x more datasets fit on a single GPU.
We describe the cohomology ring of the moduli space of a flexible polygon in geometrically meaningful terms. We propose two presentations, both are computation friendly: there are simple rules for cup product.
This paper focuses on coordinate update methods, which are useful for solving problems involving large or high-dimensional datasets. They decompose a problem into simple subproblems, where each updates one, or a small block of, variables while fixing others. These methods can deal with linear and nonlinear mappings, sm…
New algorithms adapt to friendly environments in online learning.
problem Oracle-efficient algorithms struggle with friendly environments.
method Follow-the-perturbed-leader algorithms with approximability condition.
result Best-of-both-worlds bound in oracle-efficient setting.
A new, computationally friendly formula for a class of risk-averse preferences.
problem Characterizing a class of risk-averse preferences called uniformly weighted divergence preferences.
method Introducing a new formula that characterizes UWDP as the translation-invariant hull of state-independent expected utility.
result UWDP are the translation-invariant hull of state-independent expected utility over .
For a given cusped 3-manifold admitting an ideal triangulation, we describe a method to rigorously prove that either or a filling of admits a complete hyperbolic structure via verified computer calculations. Central to our method are an implementation of interval arithmetic and Krawczyk's Test. These techni…
We introduce a mathematician-friendly formulation of the physicist-friendly derivation of the Atiyah-Patodi-Singer index of our previous paper. Our viewpoint sheds some new light on the interplay among the Atiyah-Patodi-Singer boundary condition, domain-wall fermions, and edge modes.
We prove that every Legendrian knot in the tight contact structure of the 3-sphere is determined by the contactomorphism type of its exterior. Moreover, by giving counterexamples we show this to be not true for Legendrian links in the tight 3-sphere. On the way a new user-friendly formula for computing the Thurston-Ben…
Quantum computing optimizes ESG portfolios efficiently.
problem Optimizing investment portfolios with risk, return, and ESG considerations.
method Formulated discrete Markowitz portfolio theory (DMPT) for quantum annealers, incorporating ESG ratings.
result Discrete portfolios converge to continuous solutions as budgets increase, outperforming traditional methods.
Flexible Cox model for time-dependent covariates with complex sparsity patterns.
problem Lack of flexibility in enforcing specific sparsity patterns in time-dependent Cox models.
method Proposes a flexible framework for variable selection in time-dependent Cox models, accommodating complex selection rules.
result Achieves accurate estimation with low false alarm rates for complex covariate structures.
Financial decisions impact our lives, and thus everyone from the regulator to the consumer is interested in fair, sound, and explainable decisions. There is increasing competitive desire and regulatory incentive to deploy AI mindfully within financial services. An important mechanism towards that end is to explain AI d…
tf_geometric simplifies graph deep learning in TensorFlow.
problem Efficient graph deep learning in TensorFlow.
method Kernel libraries and infrastructures for GNNs.
result tf_geometric supports various graph tasks and provides efficient GNN models.
Introduction to contact invariant in bordered Floer homology.
problem Understanding the contact invariant in bordered Floer homology.
method Construction relies on special foliated open books, with a procedure to obtain such books and a local proof of vanishing for overtwisted structures.
result Explicit bordered computation of the vanishing of the contact invariant for overtwisted structures.
The increasing deployment of machine learning as well as legal regulations such as EU's GDPR cause a need for user-friendly explanations of decisions proposed by machine learning models. Counterfactual explanations are considered as one of the most popular techniques to explain a specific decision of a model. While the…
The high computational complexity associated with training deep neural networks limits online and real-time training on edge devices. This paper proposed an end-to-end training and inference scheme that eliminates multiplications by approximate operations in the log-domain which has the potential to significantly reduc…
Root Cause Analysis for Anomalies is challenging because of the trade-off between the accuracy and its explanatory friendliness, required for industrial applications. In this paper we propose a framework for simple and friendly RCA within the Bayesian regime under certain restrictions (that Hessian at the mode is diago…
Spider GAN accelerates GAN training with a new approach.
problem Stable training of Generative adversarial networks (GANs).
method Spider GAN leverages a novel approach to identify closely related datasets (friendly neighborhoods) and uses a new measure (signed inception distance) to accelerate GAN training.
result Spider GAN achieves faster convergence and state-of-the-art FID values with one-fifth of the training iterations.
New approach improves adversarial robustness without sacrificing natural generalization.
problem Balancing adversarial robustness and natural generalization in machine learning.
method Friendly adversarial training (FAT) using early-stopped PGD to find least adversarial data.
result Early-stopped PGD achieves adversarial robustness without compromising natural generalization.
We introduce geomstats, a python package that performs computations on manifolds such as hyperspheres, hyperbolic spaces, spaces of symmetric positive definite matrices and Lie groups of transformations. We provide efficient and extensively unit-tested implementations of these manifolds, together with useful Riemannian…
Clarinet uses complementary labels to train classifiers with less source data.
problem Training classifiers with true-label data from source domain is costly.
method Proposes CLARINET to train classifiers with complementary-label source data and unlabeled target data.
result CLARINET significantly outperforms baselines in unsupervised domain adaptation.
Paper improves KNN-Shapley for privacy-friendly data valuation.
problem Privacy challenges in data valuation methods.
method Introduces TKNN-Shapley, a privacy-friendly variant of KNN-Shapley.
result TKNN-Shapley offers superior privacy-utility tradeoff compared to naively privatized KNN-Shapley.
The Atiyah-Patodi-Singer index theorem describes the bulk-edge correspondence of symmetry protected topological insulators. The mathematical setup for this theorem is, however, not directly related to the physical fermion system, as it imposes on the fermion fields a non-local and unnatural boundary condition known as …
Python package for fast simulation-based inference.
problem Intractable likelihood functions in Bayesian inference.
method Uses neural networks as surrogate models for Bayesian inference.
result Highly efficient and user-friendly for constructing SBI estimators.
AD-HOC simplifies high-order derivative calculations in C++.
problem Efficiently computing high-order derivatives in C++.
method A C++ package that calculates derivatives of arbitrary order without code generation.
result Derivatives of arbitrary order computed in a single pass.
Advocates for user-friendly RL problem descriptions to improve usability and generalization.
problem Usability and generalization challenges in RL for non-engineers.
method Development of user-friendly description languages for RL problems.
result Improved ability of RL algorithms to generalize to new problems.
CWY Parametrization: a Solution for Parallelized Optimization of Orthogonal and Stiefel Matricescs.LG
Efficiently optimizes orthogonal and Stiefel matrices on parallel units.
problem Optimization over orthogonal groups on parallel units.
method CWY and T-CWY transforms for parametrization and optimization.
result CWY and T-CWY methods lead to convergence on parallel units.
TRUST improves tree models' accuracy while maintaining interpretability.
problem Piecewise-constant regression trees lack in predictive accuracy compared to black-box models.
method Combines Random Forest accuracy with interpretability of shallow trees and sparsity of linear models, using LLMs for explanations.
result TRUST outperforms other interpretable models in predictive accuracy and matches Random Forest's accuracy.
The Inference-Compute Frontier and a Latency-Efficient Architecture for Limit Order Book Predictioncs.LG
A power-law fit to the empirical inference-compute frontier in LOB prediction suggests a scaling-law-style frontier.
problem Limit order book prediction
method Using a suite of models ranging from small decision trees to neural LOB architectures
result A power-law fit to the low- and mid-compute non-MLPLOB frontier extrapolates across multiple orders of magnitude and attains on the excluded high-compute MLPLOB target frontier.
Tuning machine learning models at scale, especially finding the right hyperparameter values, can be difficult and time-consuming. In addition to the computational effort required, this process also requires some ancillary efforts including engineering tasks (e.g., job scheduling) as well as more mundane tasks (e.g., ke…
We propose a model-based machine-learning approach for polarization-multiplexed systems by parameterizing the split-step method for the Manakov-PMD equation. This approach performs hardware-friendly DBP and distributed PMD compensation with performance close to the PMD-free case.
A simplified, user-friendly repackaging of the curvature estimates implied by the Seiberg-Witten equations is formulated in terms of the convex hull of the set of monopole classes. New results are also obtained concerning boundary cases of the resulting forms of the curvature estimates.
Optimized method tackles convex optimization with heavy-tailed noise.
problem Convex optimization problems with noisy gradients.
method Vanilla stochastic proximal subgradient method without gradient clipping or normalization.
result Achieves optimal complexity for various convex optimization types under heavy-tailed noise.
In this paper, we explore a general Aggregated Gradient Langevin Dynamics framework (AGLD) for the Markov Chain Monte Carlo (MCMC) sampling. We investigate the nonasymptotic convergence of AGLD with a unified analysis for different data accessing (e.g. random access, cyclic access and random reshuffle) and snapshot upd…
HMQ improves quantization for edge devices with mixed precision.
problem Efficient quantization for edge devices with uniform, power-of-two thresholds.
method Introduces HMQ, a mixed precision quantization block that repurposes Gumbel-Softmax for searching over quantization schemes.
result Achieves competitive and state-of-the-art results on ImageNet despite restrictions.
Proposes Learnergy, a Python framework for energy-based machine learning.
problem Lack of research and implementations around energy-based systems.
method Built upon PyTorch, Learnergy provides a more friendly environment and faster prototyping.
result Learnergy speeds up computational time using CUDA.
We present FIESTA, a model selection approach that significantly reduces the computational resources required to reliably identify state-of-the-art performance from large collections of candidate models. Despite being known to produce unreliable comparisons, it is still common practice to compare model evaluations base…
McKernel introduces a framework to use kernel approximates in the mini-batch setting with Stochastic Gradient Descent (SGD) as an alternative to Deep Learning. Based on Random Kitchen Sinks [Rahimi and Recht 2007], we provide a C++ library for Large-scale Machine Learning. It contains a CPU optimized implementation of …
arfpy simplifies data generation with adversarial random forests.
problem Synthesizing new data that matches given data.
method Adversarial Random Forests (ARF) integrated into a Python package.
result Effective and user-friendly data generation for various fields.
On-device inference of machine learning models for mobile phones is desirable due to its lower latency and increased privacy. Running such a compute-intensive task solely on the mobile CPU, however, can be difficult due to limited computing power, thermal constraints, and energy consumption. App developers and research…
Improves MCMC performance with adaptive affine transformations.
problem Improving the performance of Markov Chain Monte Carlo samplers.
method Adaptive learning of bijective affine transformations during sampling.
result Adaptive affine transformations improve the quality of samples at low computational cost.
Benchmark tests spoken language models for infant language learning.
problem Understanding how infants learn language from speech.
method Developed a language-acquisition-friendly benchmark.
result Benchmarking shows models' strengths and weaknesses.
This reviews the econophysics activities in Belgium from my admittedly biased point of view. Unknown historical notes or facts are presented for the first time explaining the aims, whence evolution of the research papers and friendly connections with colleagues. Comments on endeavors are also provided. The lack of offi…
New method simplifies 3-manifold Heegaard genus computation.
problem NP-hardness of computing Heegaard genus of 3-manifolds.
method Avoiding almost normal surfaces by modifying triangulations.
result Successfully computed Heegaard genus for 2,705 out of 3,000 manifolds.
We study holomorphic foliations with an affine homogeneous transverse structure. We give a friendly characterization of the case of transversely affine foliations in terms of matrix valued pairs of differential forms. This leads naturally to the study of the case of foliations with singularities. A first extension theo…
We present the preliminary high-level design and features of DynamicPPL.jl, a modular library providing a lightning-fast infrastructure for probabilistic programming. Besides a computational performance that is often close to or better than Stan, DynamicPPL provides an intuitive DSL that allows the rapid development of…
These lecture notes are a friendly introduction to monopole Floer homology. We discuss the relevant differential geometry and Morse theory involved in the definition. After developing the relation with the four-dimensional theory, our attention shifts to gradings and correction terms. Finally, we sketch the analogue in…
DP-Net uses dynamic programming for efficient deep neural network compression.
problem Efficiently compressing deep neural networks while maintaining accuracy.
method Dynamic Programming for optimal weight quantization and clustering-friendly training.
result Achieves up to 77X compression ratio on Wide ResNet with minimal accuracy loss.