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

2356 · Jun 202019922001200920182026
48 results for COCO

CoCos can increase financial fragility in certain network structures.

problem The effectiveness of CoCos in enhancing financial stability depends on the network structure.
method Analysis of phase transitions in a network of interconnected banks.
result CoCos can increase financial fragility under certain network structures.

Contingent Convertible bonds (CoCos) are debt instruments that convert into equity or are written down in times of distress. Existing pricing models assume conversion triggers based on market prices and on the assumption that markets can always observe all relevant firm information. But all Cocos issued so far have tri…

2018-04-18abs ↗pdf ↗

COCO-GAN generates images by parts using spatial coordinates, achieving state-of-the-art quality.

problem Generating full images from partial observations due to computational constraints.
method COCO-GAN uses conditional coordination to generate images by parts based on spatial coordinates, with a generator and discriminator learning to justify realism.
result COCO-GAN produces state-of-the-art-quality full images during inference, enabling novel applications like beyond-boundary generation and panorama generation.

We develop a pricing model for Sovereign Contingent Convertible bonds (S-CoCo) with payment standstills triggered by a sovereign's Credit Default Swap (CDS) spread. We model CDS spread regime switching, which is prevalent during crises, as a hidden Markov process, coupled with a mean-reverting stochastic process of spr…

2018-04-04abs ↗pdf ↗

Optimization algorithm CoCo improves causal inference from diverse data.

problem Identifying true causal relationships from data with spurious associations.
method CoCo optimizes for causal inference using environments with invariant causal relationships.
result CoCo provides more accurate causal estimates and predictions.

The paper examines how CoCo bonds can enhance financial stability in interconnected banking systems.

problem Enhancing financial stability in interconnected banking systems.
method Financial network model with contingent convertible (CoCo) debt obligations.
result Replacing unsecured interbank debt with CoCo debt decreases systemic risk and increases bank shareholder value.

Self-training outperforms pre-training on COCO object detection and segmentation datasets.

problem The effectiveness of pre-training in improving object detection and segmentation models is limited.
method Investigated self-training as an alternative method to utilize additional data.
result Self-training consistently improves model performance across various dataset sizes and data augmentation levels.

Cluster analysis is a fundamental tool for pattern discovery of complex heterogeneous data. Prevalent clustering methods mainly focus on vector or matrix-variate data and are not applicable to general-order tensors, which arise frequently in modern scientific and business applications. Moreover, there is a gap between …

2018-03-17abs ↗pdf ↗

In this paper we analyze an extension of the Jeanblanc and Valchev (2005) model by considering a short-term uncertainty model with two noises. It is a combination of the ideas of Duffie and Lando (2001) and Jeanblanc and Valchev (2005): share quotations of the firm are available at the financial market, and these can b…

2016-01-30abs ↗pdf ↗

Proposes group whitening to enhance deep learning models' performance.

problem Improving learning efficiency and representational capacity in deep learning models.
method Group Whitening (GW) combines whitening and group normalization to balance these aspects.
result Group Whitening consistently improves model performance across different architectures and benchmarks.

A novel GAN framework improves multi-class classification by modeling label dependencies.

problem Improving multi-class classification performance through label dependency exploitation.
method Generative adversarial networks (GANs) where the discriminator learns label dependency and the generator learns to create dependent label sets.
result The discriminator significantly enhances generalization for various classification models.

Biologically plausible learning algorithms can match BP on large datasets.

problem Learning algorithms that are biologically plausible often perform poorly on large datasets.
method Evaluation of sign-symmetry and feedback alignment algorithms on ImageNet and MS COCO.
result Sign-symmetry algorithm can match BP performance on ImageNet and MS COCO.

Optimal bounds on regret and constraint violation in adversarial COCO.

problem Minimizing regret and cumulative constraint violation in adversarial COCO.
method New surrogate loss function and Follow-the-Regularized-Leader/Online Gradient Descent.
result Achieved optimal O(T)O(\sqrt{T}) bounds on both regret and cumulative constraint violation.

This study evaluates Bayesian optimization algorithms on a wide range of problems.

problem Assessing the performance of Bayesian optimization algorithms across diverse problems.
method A comprehensive investigation using the COCO benchmark, comparing various design choices.
result Optimizing acquisition criteria and initial budget can significantly improve BO performance.

Improved COCO algorithms with better constraint control.

problem Achieving small regret and constraint violation in online convex optimization.
method Simple projection-based algorithm leveraging self-contraction geometry.
result Exponential improvement in cumulative constraint violation for strongly convex losses.

Mish is a new activation function that improves neural network performance.

problem Improving the performance and training dynamics of neural networks.
method Mish is a self-regularized non-monotonic activation function defined as f(x)=xanh(softplus(x))f(x)=x anh(softplus(x)). It outperforms other functions on benchmarks like ImageNet-1k and MS-COCO.
result Mish outperforms Leaky ReLU and ReLU on benchmarks like MS-COCO and ImageNet-1k, respectively, with comparable network parameters.

Paper introduces MCSD, a method for uncertainty estimation in deep learning.

problem Need for reliable uncertainty quantification in deep neural networks.
method Theoretical connection to variational inference and empirical benchmarking of MCSD.
result MCSD achieves competitive predictive accuracy and improves uncertainty ranking.

BlockSwap finds optimal block combinations for efficient network compression.

problem Finding the best block combinations for efficient network compression.
method Randomly initialized networks and gauging their Fisher potential to find potent block configurations.
result BlockSwap quickly explores possible block configurations using a simple architecture ranking system, yielding highly competitive networks.

The Monte Carlo pathwise sensitivities approach is well established for smooth payoff functions. In this work, we present a new Monte Carlo algorithm that is able to calculate the pathwise sensitivities for discontinuous payoff functions. Our main tool is to combine the one-step survival idea of Glasserman and Staum wi…

2018-04-11abs ↗pdf ↗

We propose a simple technique for encouraging generative RNNs to plan ahead. We train a "backward" recurrent network to generate a given sequence in reverse order, and we encourage states of the forward model to predict cotemporal states of the backward model. The backward network is used only during training, and play…

2017-08-22abs ↗pdf ↗

Paper improves COCO problem, reducing constraint violation at the cost of slightly more regret.

problem Online Convex Optimization with adversarial constraints.
method Proposes new policies that trade off regret for reduced constraint violation.
result Achieves ildeO(dT+Tβ) ilde{O}(\sqrt{dT}+ T^β) regret and ildeO(dT1β) ilde{O}(dT^{1-β}) CCV.

We present a new data-driven benchmark system to evaluate the performance of new MCMC samplers. Taking inspiration from the COCO benchmark in optimization, we view this task as having critical importance to machine learning and statistics given the rate at which new samplers are proposed. The common hand-crafted exampl…

2017-12-16abs ↗pdf ↗

Enhanced rotation prediction improves SSL models by capturing both shape and texture information.

problem Rotation prediction misses texture information, limiting model performance.
method Introduces image enhanced rotation prediction (IE-Rot) that combines rotation and image enhancement tasks.
result IE-Rot models outperform Rotation on various benchmarks.

Benchmark improves object detection robustness in winter weather.

problem Assessing object detection models' performance under image corruptions.
method Developed three benchmark datasets with various image corruptions; used data augmentation to improve robustness.
result Simple data augmentation significantly enhances model robustness across different corruptions and datasets.

Model learns image-word associations from captions using contrastive learning.

problem Phrase grounding, associating image regions to caption words.
method Optimizing word-region attention to maximize mutual information, using language model guided word substitutions for negatives.
result Model achieves 76.7% accuracy on Flickr30K Entities benchmark, a 5.7% gain from weak supervision.

SI learning is effective for unbalanced data, showing resilience to object dependencies.

problem Learning from unbalanced data in multi-instance learning.
method Analysis of SI learning objective with rich classifier families, focusing on unbalanced data.
result Unbalanced data improves resilience of SI method to object dependencies, especially in neural networks.

Efficient search methods can outperform random search on challenging tasks.

problem Comparing the performance of efficient and random search methods in neural architecture search.
method Comparison of weight sharing and random search methods on progressively larger search spaces for image classification and detection.
result Efficient search methods can provide substantial gains over random search on large, realistic tasks.

Proposes a new method to generate unrestricted adversarial examples.

problem Generating unrestricted adversarial examples without norm constraints.
method Leveraging state-of-the-art generative models to manipulate image fine-grained aspects.
result Our adversarial images look indistinguishable from natural images and can bypass certified defenses.

Paper uses SSD to detect miners' activities in a mining environment.

problem Tracking miners' activities in a mining environment with little obstruction.
method Used SSD trained on COCO dataset to detect miners' activities. Implemented machine learning algorithms using Tensorflow and C++.
result Improved accuracy of detecting miners' activities through data fusion.

ViCE uses superpixels to enhance self-supervised learning for better dense visual embeddings.

problem Lack of high-resolution feature maps from self-supervised models.
method Superpixels for dense representation learning, contrasting over regions.
result Improves unsupervised semantic segmentation on benchmarks like Cityscapes and COCO.

Deep learning yields great results across many fields, from speech recognition, image classification, to translation. But for each problem, getting a deep model to work well involves research into the architecture and a long period of tuning. We present a single model that yields good results on a number of problems sp…

2017-06-16abs ↗pdf ↗

Learning with non-modular losses is an important problem when sets of predictions are made simultaneously. The main tools for constructing convex surrogate loss functions for set prediction are margin rescaling and slack rescaling. In this work, we show that these strategies lead to tight convex surrogates iff the unde…

2015-12-24abs ↗pdf ↗

TREGO improves EGO for global optimization of high-dimensional problems.

problem Efficient Global Optimization struggles with high dimensions and lacks theoretical guarantees.
method TREGO alternates between EGO steps and local steps within a trust region.
result TREGO outperforms EGO and other methods in black-box optimization problems.