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

9182635 · Jun 202019922001200920172026
48 results for INH setups

Reinforcement learning is a promising approach to developing hard-to-engineer adaptive solutions for complex and diverse robotic tasks. However, learning with real-world robots is often unreliable and difficult, which resulted in their low adoption in reinforcement learning research. This difficulty is worsened by the …

2018-03-19abs ↗pdf ↗

Generative Adversarial Networks (GANs) produce systematically better quality samples when class label information is provided., i.e. in the conditional GAN setup. This is still observed for the recently proposed Wasserstein GAN formulation which stabilized adversarial training and allows considering high capacity netwo…

2017-09-21abs ↗pdf ↗

Study shows how task similarity affects forgetting in teacher-student setup.

problem Catastrophic forgetting in continual learning.
method Extended teacher-student setup to multiple teachers, analyzing similarity between tasks.
result Task similarity, whether at readouts or features, influences forgetting and transfer.

This article introduces the concepts around Online Bandit Linear Optimization and explores an efficient setup called SCRiBLe (Self-Concordant Regularization in Bandit Learning) created by Abernethy et. al.\cite{abernethy}. The SCRiBLe setup and algorithm yield a O(T)O(\sqrt{T}) regret bound and polynomial run time comple…

2018-05-11abs ↗pdf ↗

We introduce a setup of model uncertainty in discrete time. In this setup we derive dual expressions for the super--replication prices of game options with upper semicontinuous payoffs. We show that the super--replication price is equal to the supremum over a special (non dominated) set of martingale measures, of the c…

2013-04-12abs ↗pdf ↗

Unpaired multi-domain causal representation learning is possible with sufficient conditions.

problem Learning shared causal representation from unpaired data across domains.
method Identify sufficient conditions for joint distribution and shared causal graph recovery.
result Practical method to recover shared latent causal graph from marginal distributions.

We provide a microfoundation for linear price impact models in a stationary market.

problem Deriving linear price impact models in a stationary market with asymmetric information.
method Deriving linear price impact models as the equilibrium of an agent-based system.
result The model shows compatibility with universal price diffusion at small times and non-universal mean-reversion at larger times.

It is known that from purely observational data, a causal DAG is identifiable only up to its Markov equivalence class, and for many ground truth DAGs, the direction of a large portion of the edges will be remained unidentified. The golden standard for learning the causal DAG beyond Markov equivalence is to perform a se…

2019-10-12abs ↗pdf ↗

Survey of performative prediction, a machine learning setup causing distribution shifts.

problem Machine learning models causing shifts in the environment they predict.
method Classification of performative prediction settings based on distribution map information.
result Introduction of new solution concepts and theoretical analyses.

Study improves online learning with adaptable agents in various settings.

problem Learning with improving agents in online settings.
method Extensive analysis of combinatorial dimensions, multiclass setup, bandit feedback, and agent cost.
result Characterization and analysis of online learnability in the model.

We demonstrate how machine learning is able to model experiments in quantum physics. Quantum entanglement is a cornerstone for upcoming quantum technologies such as quantum computation and quantum cryptography. Of particular interest are complex quantum states with more than two particles and a large number of entangle…

2019-10-30abs ↗pdf ↗

Methods proposed in the literature towards continual deep learning typically operate in a task-based sequential learning setup. A sequence of tasks is learned, one at a time, with all data of current task available but not of previous or future tasks. Task boundaries and identities are known at all times. This setup, h…

2018-12-10abs ↗pdf ↗

The goal is to re-examine and extend the findings from the recent paper by Dumitrescu, Quenez and Sulem (2017) who studied game options within the nonlinear arbitrage-free pricing approach developed in El Karoui and Quenez (1997). We consider the setup introduced in Kim, Nie and Rutkowski (2018) where contracts of an A…

2018-07-14abs ↗pdf ↗

Although a key driver of Earth's climate system, global land-atmosphere energy fluxes are poorly constrained. Here we use machine learning to merge energy flux measurements from FLUXNET eddy covariance towers with remote sensing and meteorological data to estimate net radiation, latent and sensible heat and their uncer…

2018-12-11abs ↗pdf ↗

Exploration and adaptation to new tasks in a transfer learning setup is a central challenge in reinforcement learning. In this work, we build on the idea of modeling a distribution over policies in a Bayesian deep reinforcement learning setup to propose a transfer strategy. Recent works have shown to induce diversity i…

2019-06-09abs ↗pdf ↗

We examine a fundamental problem that models various active sampling setups, such as network tomography. We analyze sampling of a multivariate normal distribution with an unknown expectation that needs to be estimated: in our setup it is possible to sample the distribution from a given set of linear functionals, and th…

2012-08-12abs ↗pdf ↗

Proves wave equation solutions in Kerr-de Sitter spacetime have specific asymptotic expansions.

problem Analyzing solutions to wave equations in Kerr-de Sitter spacetime.
method Developed a Fredholm setup for quasinormal modes and analyzed trapping of lightlike geodesics.
result Proves asymptotic expansions of wave equation solutions up to a decay order.

Study improves recognition of long-tail visual relationships.

problem Improving recognition of structured visual relationships from long-tail classes.
method Developed two benchmarks, introduced VilHub loss, and applied RelMix augmentation.
result Simple techniques significantly improved performance on tail classes.

We introduce a lifelong language learning setup where a model needs to learn from a stream of text examples without any dataset identifier. We propose an episodic memory model that performs sparse experience replay and local adaptation to mitigate catastrophic forgetting in this setup. Experiments on text classificatio…

2019-06-03abs ↗pdf ↗

We introduce new online and batch algorithms that are robust to data with missing features, a situation that arises in many practical applications. In the online setup, we allow for the comparison hypothesis to change as a function of the subset of features that is observed on any given round, extending the standard se…

2011-04-05abs ↗pdf ↗

This paper studies the problem of learning clusters which are consistently present in different (continuously valued) representations of observed data. Our setup differs slightly from the standard approach of (co-) clustering as we use the fact that some form of `labeling' becomes available in this setup: a cluster is …

2010-09-19abs ↗pdf ↗

Proposes a new method for efficient manifold denoising robust to high dimensional noise.

problem Efficiently denoise manifolds in high dimensional spaces with complicated noise.
method Landmark diffusion and optimal shrinkage under high dimensional noise and compact manifold setup.
result Systematic comparison with other algorithms on simulated and real datasets shows superior performance.

New algorithm preserves transport maps for better diffusion model training.

problem Training diffusion models with task-specific optimality structures.
method Generalized Schrödinger Bridge Matching (GSBM), inspired by conditional stochastic optimal control.
result GSBM better preserves transport maps, enabling stable convergence and improved scalability.

Introduces LoCA regret to evaluate model-based RL methods.

problem Lack of consistent metrics to evaluate model-based RL methods.
method Inspired by neuroscience, introduces LoCA regret to measure model-based behavior.
result LoCA regret can identify model-based behavior and assess how close methods are to optimal model-based behavior.

We study the spinor flow on homogeneous spin manifolds. After providing the general setup we discuss the homogeneous spinor flow in dimension 3 and on almost abelian Lie groups in detail. As a further example the flag manifold in dimension 6 is treated.

2018-11-06abs ↗pdf ↗

In this paper, we study the optimal convergence rate for distributed convex optimization problems in networks. We model the communication restrictions imposed by the network as a set of affine constraints and provide optimal complexity bounds for four different setups, namely: the function $F(\xb) \triangleq \sum_{i=1}…

2017-12-01abs ↗pdf ↗

Study on private algorithms for saddle point and variational inequalities, improving efficiency and applicability.

problem Private algorithms for solving saddle point and variational inequalities under differential privacy constraints.
method Developed a recursive regularization algorithm for both Euclidean and non-Euclidean setups, providing bounds on strong SP-gap and VI-gap.
result Achieved nearly optimal rates for strong SP-gap and VI-gap under (ε,δ)(ε,δ)-differential privacy, applicable to various p,qp,q setups.

This short article revisits some of the ideas introduced in arXiv:1701.07875 and arXiv:1705.07642 in a simple setup. This sheds some lights on the connexions between Variational Autoencoders (VAE), Generative Adversarial Networks (GAN) and Minimum Kantorovitch Estimators (MKE).

2017-06-06abs ↗pdf ↗

We consider a sequential learning problem with Gaussian payoffs and side information: after selecting an action ii, the learner receives information about the payoff of every action jj in the form of Gaussian observations whose mean is the same as the mean payoff, but the variance depends on the pair (i,j)(i,j) (and may…

2015-10-27abs ↗pdf ↗