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

Trend · papers per month

209419628837 · Jun 202019922001200920172026
48 results for Objective Function Degradation

New framework for resilient bi-criteria optimization under noisy feedback.

problem Bi-criteria combinatorial optimization with noisy function evaluations.
method Introducing (α,β,δ,extttN)(α,β,δ, exttt{N})-resilience and developing a black-box framework.
result Achieves sublinear regret and constraint violation for bi-criteria bandit problems.

Study optimizes HTL-free PSCs with MWCNTs, improving efficiency and stability.

problem Optimizing efficiency and degradation in HTL-free perovskite solar cells.
method Machine learning-driven framework integrating experimental validation and numerical simulations.
result Achieved RMSEs of 0.0179 and 0.0117 for efficiency and degradation, respectively.

Develops a new method to improve performance in multi-objective learning problems.

problem Gradient bias in multi-objective learning leading to degraded performance.
method Stochastic Multi-objective gradient Correction (MoCo) method that guarantees convergence without increasing batch size.
result Demonstrates effectiveness of MoCo method in simulations on multi-task learning.

Framework optimizes battery storage for markets by separating long-term degradation from short-term market dynamics.

problem Intractable computation due to timescale mismatch between battery degradation and market dynamics.
method Approximate dynamic programming with value function approximation and pseudo-time encoding.
result Policy outperforms benchmarks in real-time market scenarios.

Theoretical study explains why federated optimization fails to achieve perfect fitting.

problem Performance degradation in federated optimization under data heterogeneity.
method Assumption of distinct local optima due to client data heterogeneity.
result The global objective has a lower bound that prevents perfect fitting of all client data.

New sparsity attacks degrade DNN efficiency, raising concerns for resource-constrained systems.

problem Vulnerabilities in DNNs through energy and latency attacks.
method Proposed sparsity attacks that modify DNN inputs to reduce activation sparsity, increasing execution time and energy consumption.
result Adversarial sparsity attacks can degrade DNN efficiency by up to 1.82x in image recognition DNNs.

This paper optimizes power grid protection settings to maximize network degradation due to cascading attacks.

problem Cascading attacks on power grids and their undetected nature.
method Constrained Bayesian Optimization applied to transmission line protection settings.
result Even limited misconfiguration of protection settings can cause severe cascading attacks.

A method for inferring ground-truth signals from degraded sensor data.

problem Inferring ground-truth signals from multiple degraded sensor signals.
method Iterative correction of degraded signals using a Bayesian multi-sensor data fusion method.
result The method effectively infers ground-truth signals from noisy and degraded sensor data.

This paper tackles noise in raw datasets to improve representation learning efficiency.

problem Noise in real-world datasets degrades representation learning quality.
method Proposes denoising Cosine-Similarity (dCS) loss to learn robust representations.
result Empirical results show the dCS loss outperforms baseline objective functions.

This work overcomes bias in concave multi-objective reinforcement learning.

problem Gradient bias in policy gradient methods for concave scalarized multi-objective reinforcement learning.
method Developed a Natural Policy Gradient (NPG) algorithm with a multi-level Monte Carlo (MLMC) estimator.
result Achieved optimal O~(ε2)\widetilde{\mathcal{O}}(ε^{-2}) sample complexity for computing an εε-optimal policy.

New model tackles real-world distribution mismatches in machine learning.

problem Real-world applications often have training and test distributions that differ.
method Developed a learning model based on information theory using importance sampling.
result The model performs better under large distribution deviations.

New algorithm improves multitask learning across diverse agents.

problem Performance degradation in decentralized learning with heterogeneous objectives.
method Developed an exact subspace diffusion algorithm for multitask learning over networks.
result The algorithm outperforms alternatives in noisy gradient approximations.

A new method for fair classification using characteristic function distance.

problem Fairness in high-stakes decision-making with sensitive groups.
method Proposes a novel approach based on characteristic function distance to ensure minimal sensitive information in learned representations.
result Consistently matches or achieves better fairness and predictive accuracy than existing methods.

This research improves multimodal systems by adding a second objective and regularisation methods.

problem Improving performance of multimodal systems with multiple objectives and regularisation.
method Introduces a second objective over multimodal fusion using variational inference and regularisation methods.
result Demonstrates potential for multiple objectives and probabilistic methods to lower variance and improve generalisation.

AdaScale SGD adapts learning rates for large-batch training efficiently.

problem Adapting learning rates for large-batch training to balance speed-ups and model quality.
method Adaptive learning rate adaptation based on gradient variance.
result AdaScale achieves reliable speed-ups for a wide range of batch sizes without degrading model quality.

New method stabilizes private LASSO for high-dimensional data with diverse covariate scales.

problem Privacy constraints and heterogeneity in covariate scales degrade LASSO stability and accuracy.
method Gram-based anisotropic objective perturbation to counteract covariate structure.
result Significantly improves convergence and statistical efficiency of private LASSO estimators.

A key advance in learning generative models is the use of amortized inference distributions that are jointly trained with the models. We find that existing training objectives for variational autoencoders can lead to inaccurate amortized inference distributions and, in some cases, improving the objective provably degra…

2017-06-07abs ↗pdf ↗

Fine-tuning harms in-context learning, but restricting updates to the value matrix improves zero-shot performance.

problem Fine-tuning harms in-context learning, reducing zero-shot performance on unseen tasks.
method Theoretical analysis of linear attention models, identifying conditions for degraded few-shot performance.
result Restricting updates to the value matrix improves zero-shot performance while preserving in-context learning.

The most common method for DNN pruning is hard thresholding of network weights, followed by retraining to recover any lost accuracy. Recently developed smart pruning algorithms use the DNN response over the training set for a variety of cost functions to determine redundant network weights, leading to less accuracy deg…

2019-05-21abs ↗pdf ↗

Boosted GFlowNets improve exploration by sequentially training GFlowNets with residual rewards.

problem GFlowNets struggle to evenly explore reward landscapes, leading to poor coverage of high-reward areas.
method Sequential training of an ensemble of GFlowNets, each optimizing a residual reward.
result Boosted GFlowNets achieve better exploration and sample diversity on multimodal benchmarks and peptide design tasks.

Statistical test detects model degradations in optimized language models.

problem Detecting model degradations in optimized language models.
method Statistical hypothesis testing framework based on McNemar's test.
result Even small accuracy degradations (0.3%) can be attributed to actual degradations, not noise.

BNCR-GAN improves GANs to generate clean images from degraded inputs.

problem Generating clean images from blurred, noisy, and compressed degraded inputs.
method Multiple-generator model with image, blur-kernel, noise, and quality-factor generators, using masking architectures and adaptive consistency losses.
result BNCR-GAN effectively learns clean image generators from degraded images without degradation parameters.

Paper improves privacy-preserving measurement of advertising incrementality.

problem Privacy degradation in randomized lift tests for advertising measurement.
method Formulates a robust causal decision problem under signal losses, projecting clean worlds onto incrementality.
result Sharp decision frontier shows valid certification or rejection outside the frontier.

We present a comprehensive framework for structured sparse coding and modeling extending the recent ideas of using learnable fast regressors to approximate exact sparse codes. For this purpose, we develop a novel block-coordinate proximal splitting method for the iterative solution of hierarchical sparse coding problem…

2012-06-18abs ↗pdf ↗

We compare the robustness of humans and current convolutional deep neural networks (DNNs) on object recognition under twelve different types of image degradations. First, using three well known DNNs (ResNet-152, VGG-19, GoogLeNet) we find the human visual system to be more robust to nearly all of the tested image manip…

2018-08-27abs ↗pdf ↗

New BO method optimizes functions efficiently even with unknown hyperparameters.

problem Inaccurate estimation of Gaussian process hyperparameters degrades BO performance.
method Exploits multi-armed bandit and novel training loss function for consistent hyperparameter estimation.
result Sub-linear convergence to global optimum with unknown hyperparameters.

BAxUS optimizes high-dimensional functions adaptively, avoiding performance degradation and failure.

problem State-of-the-art HDBO methods degrade or fail with increasing dimensions.
method BAxUS uses nested random subspaces to adaptively optimize high-dimensional functions.
result BAxUS outperforms state-of-the-art methods across various applications.

Paper develops a hybrid DNN approach for RUL prediction with adaptive drift.

problem RUL estimation challenges in practice, especially online update and uncertainty quantification.
method Hybrid DNN approach with Wiener-based-degradation model and adaptive drift. LSTM-CNN for trajectory prediction and Bayesian inference for adaptive drift.
result Superior accuracy in RUL prediction demonstrated on turbofan engines data.

Deep RL for portfolio management shows poor robustness.

problem Robustness of Deep RL algorithms in online portfolio management.
method Proposed a training and evaluation process for assessing DRL algorithms.
result Most Deep RL algorithms are not robust, generalizing poorly and degrading quickly.

Self-supervised method enhances ultrasound images without needing clean targets.

problem Multiplicative speckle, acquisition blur, and scanner artifacts hamper ultrasound interpretation.
method Physics-guided degradation model trained on rotated/cropped patches with synthesized inputs.
result Achieves highest PSNR/SSIM across Gaussian and speckle noise levels, with significant improvements in heavy noise conditions.

We investigate the topics of sensitivity and robustness in feedforward and convolutional neural networks. Combining energy landscape techniques developed in computational chemistry with tools drawn from formal methods, we produce empirical evidence indicating that networks corresponding to lower-lying minima in the opt…

2018-10-27abs ↗pdf ↗

A geometric theory explains loss functions for robust representation learning.

problem Treats robustness, domain adaptation, and sensor drift as separate literatures.
method Estimates covariance Sigma_task and uses it to pin Jacobian penalties.
result Proves optimality and necessity of range coverage for penalty matrices.