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

Trend · papers per month

90180269359 · Jun 202019922001200920172026
48 results for robust configurations

This paper investigates how network width and depth affect adversarially robust DNNs.

problem Understanding architectural configurations for adversarially robust DNNs.
method Comprehensive investigation on the impact of network width and depth on adversarial robustness.
result Optimal architectural configuration for adversarial robustness exists and can improve robustness.

Study improves communication efficiency in RIS-assisted downlink communication.

problem Improving performance of RIS-aided downlink communication over heterogeneous designs.
method Distributed learning with distributionally robust optimization.
result Our algorithm achieves 50% fewer communication rounds for similar worst-case performance.

Paper proposes a method to recover point configurations from noisy distance data.

problem Recovering point configurations from noisy distance data.
method Robust Euclidean Distance Geometry via Dual Basis (RoDEoDB) algorithm.
result Exact recovery guarantees for point configuration and Gram matrix under mild conditions.

Adapting robust statistics to neural networks, researchers found neural networks can be more robust with certain loss functions.

problem The robustness of neural networks in complex learning tasks.
method Adapting the regression breakdown point from robust statistics to neural networks and comparing different configurations and contamination settings.
result Neural networks can benefit from robust loss functions, as demonstrated in extensive simulations.

Modern deep learning methods are very sensitive to many hyperparameters, and, due to the long training times of state-of-the-art models, vanilla Bayesian hyperparameter optimization is typically computationally infeasible. On the other hand, bandit-based configuration evaluation approaches based on random search lack g…

2018-07-04abs ↗pdf ↗

Gradient boosted models are a fundamental machine learning technique. Robustness to small perturbations of the input is an important quality measure for machine learning models, but the literature lacks a method to prove the robustness of gradient boosted models. This work introduces VeriGB, a tool for quantifying the …

2019-06-26abs ↗pdf ↗

Optimizes machine learning models while controlling risks.

problem Finding a model configuration that balances multiple conflicting metrics.
method Combines Bayesian Optimization with rigorous risk-controlling procedures.
result Identifies and selects Pareto optimal configurations with guaranteed risk levels.

The goal of machine learning is to provide solutions which are trained by data or by experience coming from the environment. Many training algorithms exist and some brilliant successes were achieved. But even in structured environments for machine learning (e.g. data mining or board games), most applications beyond the…

2011-05-10abs ↗pdf ↗

Adaptive RL optimizes testing resource allocation for dynamic software environments.

problem Optimizing resource allocation for evolving software testing environments.
method Integrates Q-learning with hybrid reward design for sequential decision-making.
result Consistently outperforms static and optimization-based baselines in simulation studies.

mlr3mbo is a modular R toolbox for Bayesian optimization.

problem Efficiently solving optimization problems with multiple objectives and constraints.
method Bayesian optimization with support for multi-objective, multi-point proposals, parallelization, and custom algorithms.
result mlr3mbo performs competitively with state-of-the-art optimizers and robustly handles various optimization regimes.

Low precision weights, activations, and gradients have been proposed as a way to improve the computational efficiency and memory footprint of deep neural networks. Recently, low precision networks have even shown to be more robust to adversarial attacks. However, typical implementations of low precision DNNs use unifor…

2018-07-03abs ↗pdf ↗

Colored noise improves neural network robustness against adversarial attacks.

problem Vulnerability of neural networks to adversarial perturbations.
method Injection of colored noise into network weights and activations during adversarial training.
result Our approach outperforms previous methods in terms of adversarial accuracy on CIFAR-10 and CIFAR-100 datasets.

Quality assessments of models in unsupervised learning and clustering verification in particular have been a long-standing problem in the machine learning research. The lack of robust and universally applicable cluster validity scores often makes the algorithm selection and hyperparameter evaluation a tough guess. In t…

2018-03-29abs ↗pdf ↗

We study the configuration space of equilateral and equiangular spatial hexagons for any bond angle by giving explicit expressions of all the possible shapes. We show that the chair configuration is isolated, whereas the boat configuration allows one-dimensional deformations which form a circle in the configuration spa…

2011-05-25abs ↗pdf ↗

Machine learning (ML) classification is increasingly used in safety-critical systems. Protecting ML classifiers from adversarial examples is crucial. We propose that the main threat is that of an attacker perturbing a confidently classified input to produce a confident misclassification. To protect against this we devi…

2019-09-19abs ↗pdf ↗

We consider a problem of ranking and selection via simulation in the context of personalized decision making, where the best alternative is not universal but varies as a function of some observable covariates. The goal of ranking and selection with covariates (R&S-C) is to use simulation samples to obtain a selection p…

2017-10-07abs ↗pdf ↗

Study shows configuration spaces' homological dimension increases monotonically.

problem Understanding the homological properties of configuration spaces of manifolds.
method Analyzing the homological monotonicity of unordered configuration spaces of manifolds.
result Homological dimension of configuration spaces increases monotonically in each degree.

This work bridges theory and practice in spiking reservoirs, identifying robust parameter ranges.

problem Challenging tuning of spiking reservoirs at the edge-of-chaos.
method Introducing robustness interval, systematic evaluations, and control experiments.
result Consistent monotonic trends in robustness interval width across network configurations.

Tripod configurations of plane curves, formed by certain triples of normal lines coinciding at a point, were introduced by Tabachnikov, who showed that C2C^2 closed convex curves possess at least two tripod configurations. Later, Kao and Wang established the existence of tripod configurations for C2C^2 closed locally c…

2014-08-20abs ↗pdf ↗

We study the Orchard relation for generic configurations of points in the plane (also called order types). We introduce infinitesimally-close points and analyse the relation of this notion with the Orchard relation. The second part of the paper deals with monochromatic configurations (for the Orchard relation). We give…

2002-10-03abs ↗pdf ↗

This paper extends homological stability results for configuration spaces of manifolds.

problem Homological stability of configuration spaces of manifolds.
method Analyzing the cohomology of configuration spaces of manifolds, focusing on stability in odd and even degrees.
result The stable range for homology groups of configuration spaces depends on the dimension of the manifold and the number of configuration points.

GGFPS improves model performance by sampling molecules more efficiently.

problem Improving model performance and reducing data costs in chemistry problems.
method Gradient-Guided Furthest Point Sampling (GGFPS) that leverages molecular force norms.
result GGFPS leads to superior data efficiency and model robustness compared to other sampling methods.

We study configurations of immersed curves in surfaces and surfaces in 3-manifolds. Among other results, we show that primitive curves have only finitely many configurations which minimize the number of double points. We give examples of minimal configurations not realized by geodesics in any hyperbolic metric.

1999-03-22abs ↗pdf ↗

Proposes a robust 3D classification method for sparse point clouds.

problem Invariance to rotation, positional shift, scaling, and robustness to point sparsity in point cloud classification.
method Introduces a graph-based feature learning approach with an end-to-end neural network.
result Significantly improves 3D object classification and retrieval tasks with sparse point clouds.

Solves Plateau-Douglas problem for singular configurations in general metric spaces.

problem Existence of minimal surfaces for singular configurations.
method Generalized approach via minimal sequences in metric spaces.
result Existence of minimal surfaces for singular configurations in general metric spaces.

Ensuring that all supposedly valid configurations of a software product line (SPL) lead to well-formed and acceptable products is challenging since it is most of the time impractical to enumerate and test all individual products of an SPL. Machine learning classifiers have been recently used to predict the acceptabilit…

2018-05-30abs ↗pdf ↗