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.

169,051 papers · 148 categories

Trend · papers per month

8162432 · Feb 201919922001200920182026
48 results for ISIC 2018

The paper investigates skin tone estimation and its impact on dermatology model performance.

problem The impact of skin tone on dermatology model performance is not well understood.
method The authors use individual typology angle (ITA) to estimate skin tone in dermatology datasets and analyze model performance.
result There is no measurable correlation between model performance and ITA values.

A new asymmetric contrastive loss improves performance on imbalanced datasets.

problem Improving performance on imbalanced datasets using contrastive learning.
method Introducing an asymmetric contrastive loss (ACL) and asymmetric focal contrastive loss (AFCL).
result AFCL outperforms CL and FCL in terms of weighted and unweighted classification accuracies on imbalanced datasets.

ST-STORM separates semantic and appearance features for robust representation learning.

problem Traditional SSL methods fail to capture appearance cues in critical applications.
method Hybrid SSL framework with two latent streams, Content and Style, disentangled through gating mechanisms.
result The Style branch effectively isolates complex appearance phenomena without degrading semantic performance.

FOLKLORE algorithm speeds up online multiclass logistic regression.

problem Efficiently solving online multiclass logistic regression without high computational cost.
method Developed FOLKLORE algorithm with improved runtime and regret bound.
result First practical algorithm for online multiclass logistic regression.

Bayesian approach models policy distribution for faster exploration and transfer learning.

problem Challenges in exploration and adaptation to new tasks in transfer learning.
method Modeling a distribution over policies in a Bayesian deep reinforcement learning setup.
result Favorable experimental results on GridWorld and MiniGrid environments.

Deep reinforcement learning improves forex trading by handling complex, random processes.

problem Stable trends in deep learning predictions for forex trading.
method Used reinforcement learning, optimized Sure-Fire policy, encoded price data, compared DQN and PPO.
result Models achieved favorable investment performance, validating reinforcement learning feasibility.

Paper derives a fast learning rate for deep neural networks without scale invariant activation functions.

problem Analyzing the impact of non-scale invariant activation functions on deep learning performance.
method Using Suzuki (2018) framework, derived a tight generalization error bound for deep neural networks with non-scale invariant activations.
result Without scale invariance of activation functions, deep learning can still achieve a fast learning rate.

Improved path-length regret bounds for adaptive and oblivious adversaries.

problem Adaptive and oblivious adversaries in multi-armed bandit and linear bandit problems.
method Developed two new algorithms based on optimistic mirror descent framework with novel techniques.
result Strictly improved path-length bounds for adaptive adversary and better results for oblivious adversary.

New interpolation methods outperform Gaussian smoothing in derivative-free optimization.

problem Optimizing functions with noisy evaluations and no derivative information.
method First-order line search methods using linear interpolation vs. Gaussian smoothing.
result Linear interpolation yields better convergence rates and performance.

Study analyzes Airbnb booking lead times during global crises using a new metric.

problem Disruptions in booking behaviors during global crises affect forecasting accuracy.
method Normalized L1 (Manhattan) distance to assess lead time divergences.
result Identified two-phase disruption: abrupt change at pandemic onset followed by partial recovery.

Paper presents an active learning method to reduce skin lesion analysis annotation cost.

problem High cost of manual annotation in skin lesion analysis.
method Decoupled sample selection criteria for informativeness and representativeness, combined with pixel space aggregation for data augmentation.
result 50% annotated data suffices for state-of-the-art performance, outperforming other methods.

We consider a team of reinforcement learning agents that concurrently operate in a common environment, and we develop an approach to efficient coordinated exploration that is suitable for problems of practical scale. Our approach builds on seed sampling (Dimakopoulou and Van Roy, 2018) and randomized value function lea…

2018-05-23abs ↗pdf ↗

Adversarial examples mislead deep learning models in medical image segmentation.

problem Vulnerability of deep learning models to adversarial examples in medical image segmentation.
method Proposed Adaptive Segmentation Mask Attack (ASMA) to craft targeted adversarial examples.
result Demonstrated vulnerability of deep learning models to adversarial examples in medical image segmentation.

In this paper, we develop improved techniques for defending against adversarial examples at scale. First, we implement the state of the art version of adversarial training at unprecedented scale on ImageNet and investigate whether it remains effective in this setting - an important open scientific question (Athalye et …

2018-03-16abs ↗pdf ↗

We show that finite-width deep ReLU neural networks yield rate-distortion optimal approximation (Bölcskei et al., 2018) of polynomials, windowed sinusoidal functions, one-dimensional oscillatory textures, and the Weierstrass function, a fractal function which is continuous but nowhere differentiable. Together with thei…

2018-06-05abs ↗pdf ↗

This paper establishes lower bounds for smooth nonconvex finite-sum optimization.

problem Understanding the complexity of finding optimal solutions in nonconvex finite-sum optimization.
method Proving tight lower bounds for the complexity of finding ε-suboptimal points and ε-approximate stationary points.
result Existing algorithms achieve optimal IFO complexity up to logarithmic factors.

This Chapter, "High-dimensional ABC", is to appear in the forthcoming Handbook of Approximate Bayesian Computation (2018). It details the main ideas and concepts behind extending ABC methods to higher dimensions, with supporting examples and illustrations.

2018-02-27abs ↗pdf ↗

We re-examine and extend the findings from the recent paper by Dumitrescu, Quenez and Sulem (2018) who studied American and game options in a particular market model using the nonlinear arbitrage-free pricing approach developed in El Karoui and Quenez (1997). In the first part, we provide a detailed study of unilateral…

2018-04-28abs ↗pdf ↗

ES and FD gradients converge as optimization dimension grows.

problem Understanding the relationship between Evolution Strategies and Finite Differences gradients.
method Analyzing the convergence of gradients as the optimization dimension increases.
result ES and FD gradients converge as the dimension of the vector under optimization increases.

This Chapter, "Overview of Approximate Bayesian Computation", is to appear as the first chapter in the forthcoming Handbook of Approximate Bayesian Computation (2018). It details the main ideas and concepts behind ABC methods with many examples and illustrations.

2018-02-27abs ↗pdf ↗

On the fifth of February, 2018, the Dow Jones Industrial Average dropped 1,175.21 points, the largest single-day fall in history in raw point terms. This followed a 666-point loss on the second, and another drop of over a thousand points occurred three days later. It is natural to ask whether these events indicate a tr…

2018-06-01abs ↗pdf ↗