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,878 papers · 148 categories

Trend · papers per month

1.1%2.3%3.4%4.6% · Jun 202019922001200920172026
48 results for JD.com

This work recommends personalized search stories to users based on their interests.

problem Personalized search story recommendation within search engines.
method Deep reinforcement learning architecture trained by imitation learning and reinforcement learning.
result Empirically demonstrated effectiveness on real-world data sets.

EnsemFDet detects fraud by solving subproblems on small graphs, scaling up e-commerce fraud detection.

problem Detecting and preventing fraud in e-commerce, especially in large-scale bipartite graphs.
method EnsemFDet uses an ensemble approach to decompose the problem into smaller subproblems, solving them in parallel.
result EnsemFDet is up to 100x faster than state-of-the-art methods while maintaining high accuracy.

We present a probabilistic forecasting framework based on convolutional neural network for multiple related time series forecasting. The framework can be applied to estimate probability density under both parametric and non-parametric settings. More specifically, stacked residual blocks based on dilated causal convolut…

2019-06-11abs ↗pdf ↗

Develops large-sample theory for non-stationary source separation.

problem Lack of large-sample results for non-stationary source separation methods.
method Large-sample theory for NSS-JD method under specific assumptions.
result Consistency of unmixing estimator and its convergence to Gaussian distribution.

A manifold (M,I,J,K) is called hypercomplex if I,J,K are complex structures satisfying quaternionic relations. A quaternionic Hermitian metric is called HKT (hyperkaehler with torsion) if IdωI=JdωJ=KdωKIdω_I = Jd ω_J=Kdω_K, where ωI,ωJ,ωKω_I,ω_J, ω_K are Hermitian forms associated with I, J, K. A Hermitian metric ωω on a complex manifo…

2008-08-23abs ↗pdf ↗

E-Commerce (E-Com) search is an emerging important new application of information retrieval. Learning to Rank (LETOR) is a general effective strategy for optimizing search engines, and is thus also a key technology for E-Com search. While the use of LETOR for web search has been well studied, its use for E-Com search h…

2019-03-01abs ↗pdf ↗

Our study employs sentiment analysis to evaluate the compatibility of Amazon.com reviews with their corresponding ratings. Sentiment analysis is the task of identifying and classifying the sentiment expressed in a piece of text as being positive or negative. On e-commerce websites such as Amazon.com, consumers can subm…

2019-04-04abs ↗pdf ↗

This paper classifies commutativity spaces for 3-manifold groups.

problem Classifying commutativity spaces for geometric 3-manifold groups.
method Using geometric realization of order complexes of cosets of abelian subgroups.
result For closed orientable geometric 3-manifolds, the commutativity space is homotopy equivalent to a wedge of circles.

We present a novel optimization method, named the Combined Optimization Method (COM), for the joint optimization of two or more cost functions. Unlike the conventional joint optimization schemes, which try to find minima in a weighted sum of cost functions, the COM explores search space for common minima shared by all …

2018-08-21abs ↗pdf ↗

A brief introduction to exterior differential systems for graduate students familiar with manifolds and differential forms. For complete files, see https://github.com/Ben-McKay/introduction-to-exterior-differential-systems

2017-06-29abs ↗pdf ↗

The study of adversarial robustness has so far largely focused on perturbations bound in p-norms. However, state-of-the-art models turn out to be also vulnerable to other, more natural classes of perturbations such as translations and rotations. In this work, we thoroughly investigate the vulnerability of neural networ…

2017-12-07abs ↗pdf ↗

Study fair team formation in online labor marketplaces.

problem Design fair algorithms for team formation in online labor marketplaces.
method Define and analyze the Fair Team Formation problem, provide inapproximability results, and develop four algorithms.
result Developed four algorithms for fair team formation in online labor marketplaces.

The Variational Auto-Encoder (VAE) is one of the most used unsupervised machine learning models. But although the default choice of a Gaussian distribution for both the prior and posterior represents a mathematically convenient distribution often leading to competitive results, we show that this parameterization fails …

2018-04-03abs ↗pdf ↗

This is a review article for Encyclopedia of Complexity and System Science, to be published by Springer http://refworks.springer.com/complexity/. The paper reviews statistical models for money, wealth, and income distributions developed in the econophysics literature since late 1990s.

2007-09-23abs ↗pdf ↗

We introduce \texttt{pycobra}, a Python library devoted to ensemble learning (regression and classification) and visualisation. Its main assets are the implementation of several ensemble learning algorithms, a flexible and generic interface to compare and blend any existing machine learning algorithm available in Pytho…

2017-04-25abs ↗pdf ↗

Theoretical proof shows COMs are a type of contrastive divergence model with improved sampling.

problem Improving sampling quality in offline model-based optimization.
method Showed COMs are contrastive divergence models, proposed Langevin MCMC sampler, and decoupled model.
result Improved sampling quality achieved by decoupling model and using Langevin MCMC.
iCurrency?q-fin.GN

The paper discusses iCurrency concept and Libra's potential as a contender.

problem Analyzing Libra's potential as a contender for iCurrency.
method Analyzed Libra proposal, discussed monetary policy issues.
result Libra faces challenges in maintaining exchange rate stability.

Improved LLM pre-training performance through better weight and variance control.

problem Improper weight and variance control in LLM pre-training affects downstream task performance.
method Introduced Layer Index Rescaling (LIR) and Target Variance Rescaling (TVR) techniques.
result Substantial improvements in downstream task performance (up to 4.6%) and reduced extreme activation values.

This work optimizes alignment and uniformity of features on a hypersphere for better downstream performance.

problem Improving the performance of contrastive representation learning.
method Identifying and optimizing alignment and uniformity of features on a hypersphere.
result Directly optimizing alignment and uniformity leads to comparable or better performance than contrastive learning.

ParaMonte simplifies Monte Carlo simulations for various scientific fields.

problem Efficiently performing Monte Carlo simulations for complex models.
method Unified, high-performance, parallelized library for C, C++, Fortran.
result Automates and streamlines Monte Carlo sampling for arbitrary-dimensional functions.

A new method, Count-MORL, improves offline reinforcement learning by using state-action frequency.

problem Improving offline reinforcement learning performance.
method Integrates count-based conservatism into model-based offline reinforcement learning.
result The learned policy is near-optimal and outperforms existing methods.

We present examples of foliations with infinite dimensional basic symplectic and com- plex cohomologies, along with a general sufficient condition for such phenomena. This puts re- strictions on possible generalizations of several finiteness results from Riemannian foliations to any broader class. The examples are also…

2017-05-05abs ↗pdf ↗

A novel framework refines diffusion models iteratively for better downstream reward optimization.

problem Optimizing reward functions during inference of diffusion models.
method Iterative refinement process with noising and reward-guided denoising steps.
result Superior empirical performance in protein and DNA design.

Regression is widely used by practioners across many disciplines. We reformulate the underlying optimisation problem as a second-order conic program providing the flexibility often needed in applications. Using examples from portfolio management and quantitative trading we solve regression problems with and without con…

2013-10-12abs ↗pdf ↗

Novel technique reduces Bayesian network complexity while preserving inference accuracy.

problem Complexity reduction in Bayesian networks for efficient inference.
method Directed convex hull structure and polynomial-time algorithm for identifying minimum localized networks.
result High dimension reduction capability and improved inference efficiency in real networks.

advertorch is a toolbox for adversarial robustness research. It contains various implementations for attacks, defenses and robust training methods. advertorch is built on PyTorch (Paszke et al., 2017), and leverages the advantages of the dynamic computational graph to provide concise and efficient reference implementat…

2019-02-20abs ↗pdf ↗