Suboptimality
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Consumers often make suboptimal loan prepayment choices
Consumers often make suboptimal loan prepayment choices Gaby Clark Scientific Editor Andrew Zinin Lead Editor When consumers pay down debt, many choose to put funds toward their oldest loans first—even when doing so may not make the most financial sense, according to recent research by Alicia M. Johnson, assistant professor of marketing at the Isenberg School of Management. In a paper published in the Journal of Marketing Research, Johnson and her co-authors examined how consumers decide...
Optimality of quasi-Monte Carlo methods and suboptimality of the sparse-grid Gauss--Hermite rule in Gaussian Sobolev spaces
Announce Type: replace Abstract: Optimality of several quasi-Monte Carlo methods and suboptimality of the sparse-grid quadrature based on the univariate Gauss--Hermite rule is proved in the Sobolev spaces of mixed dominating smoothness of order $\alpha$, where the optimality is in the sense of worst-case convergence rate. For sparse-grid Gauss--Hermite quadrature, lower and upper bounds are established, with rates coinciding up to a logarithmic factor. The dominant rate is found to be only...
Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+
arXiv:2406.10407v3 Announce Type: replace-cross Abstract: Semidefinite programs (SDPs) and their solvers are powerful tools with many applications in machine learning and data science. Designing scalable SDP solvers is challenging because by standard the positive semidefinite decision variable is an $n \times n$ dense matrix, even though the input is often an $n \times n$ sparse matrix. However, the solution may not require a full-rank matrix, as shown by Barvinok and Pataki.
Inverse Reinforcement Learning without an Optimal Demonstrator: A Feasible Reward Set Approach
arXiv:2605.30903v1 Announce Type: new Abstract: Inverse reinforcement learning (IRL) typically assumes demonstrations from a single optimal demonstrator, but in many applications data come from multiple imperfect demonstrators with heterogeneous suboptimality levels. We study reward learning in this setting through a feasible-reward-set framework: for each demonstrator, we encode its declared suboptimality level as a linear constraint and intersect the resulting feasible sets across...
Preference-Calibrated Human-in-the-Loop Reinforcement Learning for Robotic Manipulation
arXiv:2606.03949v1 Announce Type: new Abstract: Human-in-the-loop reinforcement learning (HIL-RL) improves sample efficiency in real-robot manipulation through online human intervention. However, successful trajectories may include suboptimal actions that deviate from the desired task-execution path and force human intervention. Existing HIL-RL methods typically apply the consistent credit assignment principle to all transitions, uniformly propagating discounted terminal rewards through...
Frequency Decoupled Framework for Screen Content Image Super-Resolution
arXiv:2606.09029v1 Announce Type: new Abstract: Methods based on implicit neural representations have demonstrated superior performance in Screen Content Image Super-Resolution (SCISR) . However, they overlooked the inherent frequency characteristics, leading to suboptimal performance.
Beyond Model Base Retrieval: Weaving Knowledge to Master Fine-grained Neural Network Design
arXiv:2507.15336v3 Announce Type: replace Abstract: Designing high-performance neural networks for new tasks requires balancing optimization quality with search efficiency. Current methods fail to achieve this balance: neural architectural search is computationally expensive, while model retrieval often yields suboptimal static checkpoints. To resolve this dilemma, we model the performance gains induced by fine-grained architectural modifications as edit-effect evidence and build evidence...
UniADC: A Unified Framework for Anomaly Detection and Classification
arXiv:2511.06644v3 Announce Type: replace Abstract: In this paper, we introduce a novel task termed unified anomaly detection and classification, which aims to simultaneously detect anomalous regions in images and identify their specific categories. Existing methods typically treat anomaly detection and classification as separate tasks, thereby neglecting their inherent correlations and limiting information sharing, which results in suboptimal performance. To address this, we propose UniADC,...
Reward Shaping for (Inference-Time) Alignment: A Stackelberg Game Perspective
arXiv:2602.02572v2 Announce Type: replace Abstract: Existing alignment methods directly use the reward model learned from user preference data to optimize an LLM policy, subject to KL regularization with respect to the base policy. This practice is suboptimal for maximizing user's utility because the KL regularization may cause the LLM to inherit the bias in the base policy that conflicts with user preferences. While amplifying rewards for preferred outputs can mitigate this bias, it also...
Power-Aware Cognitive Radar Multi-target Tracking Under Unknown Disturbances
arXiv:2507.17506v4 Announce Type: replace-cross Abstract: This work presents a cognitive radar (CR) framework designed to track multiple aircraft under unknown disturbances using massive multiple-input multiple-output (MMIMO) systems. Since uniform power allocation is suboptimal across varying signal-to-noise ratios (SNRs), we couple an adaptive waveform design driven by Partially Observable Monte Carlo Planning (POMCP). By assigning an independent POMCP tree to each target, the system...