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

195390585780 · Jun 202019922001200920172026
48 results for multiple loss terms

MTAdam optimizes multiple loss terms in neural models, balancing gradients dynamically.

problem Balancing multiple loss terms in neural model training is challenging and computationally demanding.
method Generalized Adam algorithm that computes separate derivatives and balances gradients across layers dynamically.
result Training with MTAdam leads to faster recovery from suboptimal initial loss weighting and matches conventional training outcomes.

New scalable algorithm for non-negative linear regression with entropy-regularized OT loss.

problem Generalizing task-specific linear models to broader applications.
method Sinkhorn-like scaling iterations for convex penalty and datafit terms.
result Simple multiplicative updates for various penalty and datafit terms.

Model shows how banks' fears of future defaults can cause immediate financial stress.

problem How banks' future default worries cause immediate financial stress.
method Dynamic interbank model with endogenous distress contagion, mark-to-market valuation adjustment, forward-backward approach.
result Distress contagion acts as a stochastic volatility term leading to clustering and down-market spikes.

Malware detection is a popular application of Machine Learning for Information Security (ML-Sec), in which an ML classifier is trained to predict whether a given file is malware or benignware. Parameters of this classifier are typically optimized such that outputs from the model over a set of input samples most closely…

2019-03-13abs ↗pdf ↗

New insights into training machine learning models with momentum.

problem Lack of theoretical understanding on the generalization error of momentum-based methods.
method Analyzed modified momentum-based update rule (SGDEM) for smooth Lipschitz loss functions.
result SGDEM admits an upper-bound on the generalization error for smooth Lipschitz loss functions.

Study on learning to defer with multiple experts using new surrogate losses.

problem Learning to defer with multiple experts in a machine learning context.
method Introducing a new family of surrogate losses for the multiple-expert setting, proving HH-consistency bounds, and designing learning algorithms.
result Explicit guarantees for new learning to defer algorithms based on minimization of these surrogate losses.

We study online aggregation of the predictions of experts, and first show new second-order regret bounds in the standard setting, which are obtained via a version of the Prod algorithm (and also a version of the polynomially weighted average algorithm) with multiple learning rates. These bounds are in terms of excess l…

2014-02-10abs ↗pdf ↗

We present a TTS neural network that is able to produce speech in multiple languages. The proposed network is able to transfer a voice, which was presented as a sample in a source language, into one of several target languages. Training is done without using matching or parallel data, i.e., without samples of the same …

2019-02-06abs ↗pdf ↗

While momentum-based accelerated variants of stochastic gradient descent (SGD) are widely used when training machine learning models, there is little theoretical understanding on the generalization error of such methods. In this work, we first show that there exists a convex loss function for which the stability gap fo…

2018-09-12abs ↗pdf ↗

Improved SVRG with a coefficient reduces training loss in deep learning.

problem Demonstrating SVRG's effectiveness in deep learning.
method Introduced a multiplicative coefficient α to control SVRG's variance reduction strength and decay it linearly.
result α-SVRG consistently reduces training loss compared to baseline and standard SVRG across various model architectures and datasets.

Method estimates multiple related Gaussian distributions using Laplacian regularization.

problem Jointly estimate multiple related zero-mean Gaussian distributions.
method Laplacian regularized stratified model fitting with hyper-parameters to encourage covariance closeness.
result The method performs well, especially in low data regimes, as demonstrated in finance, radar, and weather.

This paper presents a new mathematical framework to analyze the loss functions of deep neural networks with ReLU functions. Furthermore, as as application of this theory, we prove that the loss functions can reconstruct the inputs of the training samples up to scalar multiplication (as vectors) and can provide the numb…

2018-05-18abs ↗pdf ↗

This work includes a number of novel contributions for the multiple-source adaptation problem. We present new normalized solutions with strong theoretical guarantees for the cross-entropy loss and other similar losses. We also provide new guarantees that hold in the case where the conditional probabilities for the sour…

2018-05-20abs ↗pdf ↗

This paper tackles deferral learning with multiple experts, providing strong theoretical guarantees.

problem Optimizing input assignment to experts balancing accuracy and computational cost.
method Introducing new surrogate loss functions and efficient algorithms with strong theoretical learning guarantees.
result Realizable HH-consistency, HH-consistency bounds, and Bayes-consistency for deferral learning.

We introduce negative binomial matrix factorization (NBMF), a matrix factorization technique specially designed for analyzing over-dispersed count data. It can be viewed as an extension of Poisson matrix factorization (PF) perturbed by a multiplicative term which models exposure. This term brings a degree of freedom fo…

2018-01-05abs ↗pdf ↗

Paper uses deep Ritz method for solving stationary Schrödinger equation, proving convergence and feature emergence.

problem Solving stationary Schrödinger equation with high-dimensional features.
method Deep Ritz method, gradient descent, single-index model, two-neuron model.
result Gradient descent converges to near-optimal solution, feature emergence observed in two-neuron model.

New algorithms avoid a dominant lower-order term in heavy-tailed loss settings.

problem Prediction with heavy-tailed losses without prior knowledge.
method Adaptive algorithms that avoid the maximum of losses as a lower-order term in regret.
result Improved regret bounds of O(θTlog(K))\mathcal{O}(\sqrt{θT\log(K)}) and O(θlog(KT)/Δmin)\mathcal{O}(θ\log(KT)/Δ_{\min}).

In this paper, we propose a new loss function called generalized end-to-end (GE2E) loss, which makes the training of speaker verification models more efficient than our previous tuple-based end-to-end (TE2E) loss function. Unlike TE2E, the GE2E loss function updates the network in a way that emphasizes examples that ar…

2017-10-28abs ↗pdf ↗

Study of estimation errors in surrogate loss minimizers, providing stronger guarantees than existing methods.

problem Estimation errors in surrogate loss minimizers for various hypothesis sets.
method Detailed study of H\mathscr{H}-consistency estimation error bounds, proving general theorems for distribution-dependent and independent settings.
result Explicit bounds for zero-one and adversarial losses, showing enhancements under distributional assumptions.

Unpaired image-to-image translation has attracted significant interest due to the invention of CycleGAN, a method which utilizes a combination of adversarial and cycle consistency losses to avoid the need for paired data. It is known that the CycleGAN problem might admit multiple solutions, and our goal in this paper i…

2020-01-24abs ↗pdf ↗

This paper analyzes optimal consumption strategies for loss-averse investors with multiplicative habit formation.

problem Optimal consumption strategies for loss-averse investors with multiplicative habit formation.
method The study uses a concave envelope of the S-shaped utility function and a nonlinear free boundary problem to analyze the HJB equation.
result The paper provides optimal consumption and investment policies in feedback form.

Proposes a method to ensure low losses across all subpopulations in large datasets.

problem Standard practice of minimizing average loss fails to guarantee low losses across all subpopulations in heterogeneous datasets.
method Convex procedure that controls worst-case performance over all subpopulations of a given size with finite-sample convergence guarantees.
result Empirically, the worst-case procedure learns models that do well against unseen subpopulations.

We study long-term growth-optimal strategies on a simple market with linear proportional transaction costs. We show that several problems of this sort can be solved in closed form, and explicit the non-analytic dependance of optimal strategies and expected frictional losses of the friction parameter. We present one der…

1999-08-18abs ↗pdf ↗

Study on Bayesian deep linear networks with multiple outputs and convolutional layers.

problem Characterize feature learning in finite-width Bayesian deep linear networks.
method Exact and analytical formulas for joint and posterior distributions, using large deviation theory.
result Quantitative description of feature learning in infinite-width regime.

A novel method detects multiple mitosis events and mitigates annotation gaps in phase-contrast microscopy.

problem Detecting multiple mitosis events and handling annotation gaps in closely placed cells.
method Estimating a spatiotemporal likelihood map via 3DCNN to detect multiple mitosis events and mitigate annotation gaps.
result Our method outperformed compared methods in terms of F1-score using a challenging dataset.

The paper decomposes probabilistic scores into reliability, uncertainty, and information loss.

problem Understanding the reliability and uncertainty of probabilistic predictions.
method Developed decomposition identities for proper losses, quantifying reliability, residual uncertainty, and information gain.
result A three-term identity for classification scores, revealing miscalibration, grouping term, and feature-level uncertainty.

Proposes squentropy loss for improved classification accuracy and model calibration.

problem Theoretical and empirical evidence for cross-entropy loss is lacking.
method Introduces squentropy loss as the sum of cross-entropy and average square loss over incorrect classes.
result Squentropy loss outperforms cross-entropy and rescaled square losses in classification accuracy and model calibration.

Study on learning to defer to multiple experts with consistent surrogates and confidence calibration.

problem Addressing the open problems of consistent surrogates, confidence calibration, and ensembling of experts.
method Derive two consistent surrogates (softmax and OvA) and propose a conformal inference technique for choosing experts.
result The OvA-based loss does not cause mis-calibration propagation, while the softmax-based loss does.

Paper proposes a new anomaly detection method using Random Forest with Mallows-like criterion.

problem Inherent uncertainty in model selection for anomaly detection.
method Integrates Mallows-like criterion into Random Forest algorithm for anomaly detection.
result Proposed method outperforms traditional methods in accuracy and robustness.

Paper develops upper-bounds for target general loss in multiple source DA and DG settings.

problem Complexity and trade-offs in multiple source domain adaptation and domain generalization.
method Defines two types of domain-invariant representations and studies their pros, cons, and trade-offs.
result Developed upper-bounds for target general loss offer insights into domain-invariant representations.

A hybrid loss framework improves time series forecasting by balancing global and component errors.

problem Current time series methods may prioritize less significant sub-series, leading to forecasting bias.
method Proposes a hybrid loss framework combining global and component losses, dynamically adjusting weights.
result Improves time series forecasting performance by 0.5-2% on average.

In this manuscript we propose two objective terms for neural image compression: a compression objective and a cycle loss. These terms are applied on the encoder output of an autoencoder and are used in combination with reconstruction losses. The compression objective encourages sparsity and low entropy in the activatio…

2019-05-24abs ↗pdf ↗

Unified framework for binary responses using AUC loss and low-rank constraint.

problem Statistical inefficiency and shared structure in fitting multiple binary responses.
method Pairwise AUC loss aggregation with low-rank constraint, scalable projected gradient descent.
result Unified framework outperforms likelihood-based approaches in challenging settings.

Proposes sigmoidF1 loss for multilabel classification, improving performance metrics.

problem Lack of smooth, tractable loss functions for multilabel classification.
method Introduces sigmoidF1, a smooth F1 score surrogate loss function.
result sigmoidF1 outperforms other loss functions on various datasets and metrics.