Research
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,786 papers · 148 categories

Trend · papers per month

53105158210 · Jun 202019922001200920172026
48 results for non-uniform cost

Cost-aware multi-objective Bayesian optimization for non-uniformly expensive functions.

problem Non-uniform cost of function evaluations in Bayesian optimization.
method Introduces cost-aware constraints and a new acquisition function to optimize multi-objective functions with varying costs.
result Demonstrates improved optimization in hyperparameter tuning of neural networks and random forests.

STR reparameterizes DNN weights with soft thresholds for better sparsity and accuracy.

problem Improving sparsity in DNNs for better accuracy and lower inference cost.
method Soft Threshold Reparameterization (STR) using the soft-threshold operator on DNN weights.
result STR achieves state-of-the-art accuracy and reduces FLOPs by up to 50%.

Accelerated coordinate descent is widely used in optimization due to its cheap per-iteration cost and scalability to large-scale problems. Up to a primal-dual transformation, it is also the same as accelerated stochastic gradient descent that is one of the central methods used in machine learning. In this paper, we imp…

2015-12-30abs ↗pdf ↗

The study finds non-uniform lattices with thin Hitchin representations in specific Lie groups.

problem Finding thin Hitchin representations in non-uniform lattices of Lie groups.
method Arithmetic methods to construct thin Hitchin representations.
result Infinitely many orbits of thin Hitchin representations in non-uniform lattices.

Many stochastic optimization algorithms work by estimating the gradient of the cost function on the fly by sampling datapoints uniformly at random from a training set. However, the estimator might have a large variance, which inadvertently slows down the convergence rate of the algorithms. One way to reduce this varian…

2017-08-08abs ↗pdf ↗

Optimizes query routing to LLMs under cost and resource constraints.

problem Non-uniform or adversarial batching in per-query routing methods leads to cost inefficiency.
method Batch-level, resource-aware routing framework that jointly optimizes model assignment for each batch.
result Robust routing framework improves accuracy by 1-14% over non-robust methods.

New approach to adversarial robustness with non-uniform perturbations.

problem Real-world adversaries craft adversarial examples with non-uniform perturbations.
method Proposes non-uniform perturbations based on feature dependencies and data distribution.
result Shows improved robustness to real-world attacks compared to uniform perturbations.

This work studies the robustness certification problem of neural network models, which aims to find certified adversary-free regions as large as possible around data points. In contrast to the existing approaches that seek regions bounded uniformly along all input features, we consider non-uniform bounds and use it to …

2019-03-15abs ↗pdf ↗

New approach finds minima of geodesic lengths for non-uniform fillings.

problem Finding minima of geodesic length functions for non-uniform fillings.
method Elementary optimization for 4-regular topological fillings, analysis of fat graphs and optimization techniques.
result Minima of geodesic length functions are found to be at triangle surfaces in both analyzed classes of non-uniform fillings.

APoT quantization improves neural network efficiency and accuracy.

problem Efficiently quantizing weights and activations in neural networks.
method Constraining quantization levels as sums of Powers-of-Two terms, applying reparameterization, and weight normalization.
result 4-bit quantized ResNet-50 achieves 76.6% top-1 accuracy, 22% computational cost reduction.

Non-uniform lattices in PU(n,1) cannot geometrically act on CAT(0) cube complexes.

problem Non-uniform lattices in PU(n,1) cannot geometrically act on CAT(0) cube complexes.
method Proving non-uniform lattices in PU(n,1) cannot geometrically act on CAT(0) cube complexes.
result Non-uniform lattices in PU(n,1) cannot geometrically act on CAT(0) cube complexes.

New method detects communities in complex hypergraphs, matching theoretical limits.

problem Detecting communities in non-uniform hypergraphs with varying hyperedge sizes.
method Developed a spectral theory for weighted non-backtracking operators on non-uniform hypergraphs.
result Achieved the Kesten-Stigum bound for weak recovery in a general class of non-uniform HSBMs.

Sharp threshold for exact recovery in non-uniform hypergraph stochastic block model.

problem Community detection in random hypergraphs with non-uniform hyperedge probabilities.
method Sharp threshold established; two efficient algorithms for exact recovery.
result Sharp threshold for exact recovery; information-theoretic lower bound on misclassification.

Improved sampling accuracy in SG-MCMC methods via non-uniform gradient subsampling.

problem Computational inefficiency and sampling error in stochastic gradient MCMC methods.
method Proposes a non-uniform subsampling scheme to reduce sampling error in EWSG, a variant of SG-MCMC.
result EWSG reduces sampling error compared to uniform subsampling, improving accuracy without sacrificing convergence speed.

A groupoid Ω(B)Ω\left( \mathcal{B} \right) called material groupoid is naturally associated to any simple body B\mathcal{B}. The material distribution is introduced due to the (possible) lack of differentiability of the material groupoid. Thus, the inclusion of these new objects in the theory of material bodies opens th…

2018-12-11abs ↗pdf ↗

We improve GANs by enforcing reproducibility and using non-uniform sampling.

problem Overrepresentation of certain samples in GANs' marginal log-likelihood.
method Enforce reproducibility through matching empirical distribution to prior, use non-uniform sampling for mini-batch selection.
result Improved quality and variety in generated samples, validated on CIFAR10, Fashion MNIST, and CelebA.

We study the effectiveness of non-uniform randomized feature selection in decision tree classification. We experimentally evaluate two feature selection methodologies, based on information extracted from the provided dataset: (i)(i) \emph{leverage scores-based} and (ii)(ii) \emph{norm-based} feature selection. Experimenta…

2014-03-24abs ↗pdf ↗

Improved matrix completion for non-uniformly sampled data.

problem Estimating unobserved entries in a matrix with varying sampling probabilities.
method Developed entry-specific bounds for low-rank matrix completion under structured non-uniform sampling.
result Error bounds for each entry match minimax lower bounds under certain conditions.

New loss function equivalence reveals PER's uniform sampling can be improved.

problem Improving Prioritized Experience Replay (PER) for better learning efficiency.
method Transforming non-uniformly sampled data loss functions into uniformly sampled ones.
result Some environments can replace PER with a new loss function without performance loss.

Spectral algorithm recovers community structure in sparse hypergraphs.

problem Community detection in sparse random hypergraphs with community structure and higher-order interactions.
method Spectral algorithm with three steps: hyperedge selection, spectral partition, and correction/merging.
result Weak consistency achieved for weak signal-to-noise ratio.

The paper proves Zimmer's conjecture for non-uniform lattices by controlling mass escape and Lyapunov exponents.

problem Proving Zimmer's conjecture for non-uniform lattices in higher-rank semisimple Lie groups.
method Establishes finiteness of low-dimensional actions, introduces novel techniques to control mass escape and Lyapunov exponents.
result Proves Zimmer's conjecture for many non-uniform lattices, improving previous results.

The study finds that certain hyperbolic manifolds contain subgroups isomorphic to surface groups.

problem The existence of thin surface subgroups in non-uniform arithmetic lattices.
method Analyzes arithmetic hyperbolic manifolds and their fundamental groups.
result Fundamental groups of non-compact arithmetic hyperbolic manifolds contain thin surface subgroups.

Validates conformal prediction for network data under non-uniform sampling.

problem Validity of conformal prediction for network data under non-representative sampling.
method Interprets sampling mechanisms as selection rules, studies validity conditional on selection events, uses permutation invariance and joint exchangeability.
result Finite-sample validity of conformal prediction for certain selection events and asymptotic validity for random walk sampling.

Paper uses IGA for efficient pricing of financial derivatives, comparing it to FDM and FEM.

problem Efficiently pricing complex financial derivatives with high accuracy.
method Isogeometric Analysis (IGA) for solving nonlinear Black-Scholes PDEs.
result IGA provides very accurate solutions with fewer knots, significantly reducing computational time.

Rough Transformers improve time series modeling with lower costs and better performance.

problem Inefficient modeling of irregularly sampled time series data.
method Signature patching for continuous-time representations, reducing computational costs.
result Rough Transformers outperform vanilla Transformers and Neural ODE models.

A new method for matrix completion with model-free weights.

problem Matrix completion under non-uniform missing structures.
method Constructs weights via convex optimization to adjust for non-uniformity without modeling observation probabilities.
result Recover matrix with stronger theoretical guarantees, especially in heterogeneous missing settings.

Let GG and GG' be simple Lie groups of equal real rank and real rank at least 22. Let Γ<GΓ<G and Λ<GΛ< G' be non-uniform lattices. We prove a theorem that often implies that any quasi-isometric embedding of ΓΓ into ΛΛ is at bounded distance from a homomorphism. For example, any quasi-isometric embedding of $SL(n,\ma…

2015-12-22abs ↗pdf ↗

Sub-sampling is a common and often effective method to deal with the computational challenges of large datasets. However, for most statistical models, there is no well-motivated approach for drawing a non-uniform subsample. We show that the concept of an asymptotically linear estimator and the associated influence func…

2017-09-06abs ↗pdf ↗

The fundamental group of a Riemannian manifold with δδ-pinched negative curvature, δ>1/4δ>1/4, cannot be the fundamental group of a quasicompact Kähler manifold. The proof also implies that a non-uniform lattice in F4(20)F_{4(-20)} cannot be the fundamental group of a quasicompact Kähler manifold. We also construct examples …

2003-12-07abs ↗pdf ↗