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

1122 · Apr 201919922001200920172026
17 results for G-Learning

Enhanced portfolio optimization for a financial goal with G-Learning and GIRL algorithms.

problem Maximize portfolio value while minimizing periodic contributions by a target date in volatile markets.
method Combines G-Learning and GIRL algorithms for dynamic portfolio optimization.
result Improved Sharpe Ratio from 0.42 to 0.483, demonstrating robust optimization in volatile markets.

We consider the problem of estimating the mean and covariance of a distribution from iid samples in Rn\mathbb{R}^n, in the presence of an ηη fraction of malicious noise; this is in contrast to much recent work where the noise itself is assumed to be from a distribution of known type. The agnostic problem includes many…

2016-04-24abs ↗pdf ↗

Deep neural networks and decision trees operate on largely separate paradigms; typically, the former performs representation learning with pre-specified architectures, while the latter is characterised by learning hierarchies over pre-specified features with data-driven architectures. We unite the two via adaptive neur…

2018-07-17abs ↗pdf ↗

Classically, imitation learning algorithms have been developed for idealized situations, e.g., the demonstrations are often required to be collected in the exact same environment and usually include the demonstrator's actions. Recently, however, the research community has begun to address some of these shortcomings by …

2019-05-22abs ↗pdf ↗

New metric measures dynamical richness without relying on accuracy.

problem Lack of a reliable metric for measuring dynamical richness.
method Developed a computationally efficient, performance-independent metric based on low-rank bias.
result Metric recovers neural collapse as a special case and captures known transitions without accuracy.

Several recently proposed stochastic optimization methods that have been successfully used in training deep networks such as RMSProp, Adam, Adadelta, Nadam are based on using gradient updates scaled by square roots of exponential moving averages of squared past gradients. In many applications, e.g. learning with large …

2019-04-19abs ↗pdf ↗

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.

In this paper, we propose and investigate a variety of distributed deep learning strategies for automatic speech recognition (ASR) and evaluate them with a state-of-the-art Long short-term memory (LSTM) acoustic model on the 2000-hour Switchboard (SWB2000), which is one of the most widely used datasets for ASR performa…

2019-04-10abs ↗pdf ↗

Embedding methods which enforce a partial order or lattice structure over the concept space, such as Order Embeddings (OE) (Vendrov et al., 2016), are a natural way to model transitive relational data (e.g. entailment graphs). However, OE learns a deterministic knowledge base, limiting expressiveness of queries and the…

2018-05-17abs ↗pdf ↗

Machine learning has begun to play a central role in many applications. A multitude of these applications typically also involve datasets that are distributed across multiple computing devices/machines due to either design constraints (e.g., multiagent systems) or computational/privacy reasons (e.g., learning on smartp…

2019-08-21abs ↗pdf ↗

Reincarnating RL reuses prior work to accelerate RL progress.

problem Efficiency and accessibility in reinforcement learning for large-scale applications.
method Transfer of learned policies between RL agents or design iterations, focusing on value-based RL.
result Demonstrated gains in performance over tabula rasa RL on various tasks.

Efficiently estimate Boolean product distribution parameters from truncated samples.

problem Estimating parameters of Boolean product distributions from truncated samples.
method Introducing fatness of truncation set, using membership queries, and adapting Stochastic Gradient Descent.
result Efficiently learn Boolean product distributions from truncated samples with small sample complexity.

New lens on self-supervised learning: parameter identifiability.

problem Identifying good features for downstream tasks in self-supervised learning.
method Consider data from a parametric probabilistic model, train a predictor, and ask if ground truth parameters can be read off the optimal predictor.
result Some prediction tasks yield identifiability, others do not, revealing a rich landscape.

Generative adversarial networks (GANs) can be interpreted as an adversarial game between two players, a discriminator D and a generator G, in which D learns to classify real from fake data and G learns to generate realistic data by "fooling" D into thinking that fake data is actually real data. Currently, a dominating …

2018-09-06abs ↗pdf ↗

The paper uses geometry to assess how hard examples are for NLP models.

problem Challenges in NLP datasets and classifiers, especially with shallow features.
method Information geometry to quantify example difficulty, exploring BERT, CNN, and fasttext.
result Deep learning models are vulnerable to word substitutions in difficult examples.