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

220439659878 · Jun 202019922001200920172026
48 results for two-phase algorithm

Improved statistical inference for expensive data using machine learning predictions.

problem Statistical inference under adaptive two-phase multiwave sampling with expensive measurements.
method Multiwave Predict-Then-Debias estimator combining proxy information and expensive measurements.
result Valid estimators and confidence intervals for M-estimation under adaptive sampling.

Proposes a method to estimate sparse Gaussian graphical models with hidden clustering structure.

problem Modeling statistical relationships between variables with sparsity and clustering.
method Two-phase algorithm using sGS-ADMM for initial point and pALM for solution.
result Demonstrates good performance and efficiency of the proposed model and algorithm on synthetic and real data.

Common models for two-phase lipid bilayer membranes are based on an energy that consists of an elastic term for each lipid phase and a line energy at interfaces. Although such an energy controls only the length of interfaces, the membrane surface is usually assumed to be at least C1C^1 across phase boundaries. We consi…

2016-03-01abs ↗pdf ↗

Detects anomalies in product health metrics at eBay for better alerts.

problem Detecting anomalies in unsupervised product health metrics at eBay.
method Developed a Moving Metric Detector (MMD) for anomaly detection and a point-wise ranking model for alert retrieval.
result Improves alert precision and avoids alert spamming in eBay production.

This paper proposes a new global optimization algorithm using deep learning.

problem Developing efficient algorithms for global optimization of non-convex functions.
method Two-phase approach: minimization phase with model-driven deep learning, escaping phase with reinforcement learning.
result The proposed algorithm significantly outperforms classical optimization methods and handles ill-posed functions.

Study shows thresholding scheme converges for mean curvature flow of convex sets.

problem Analyzing convergence of thresholding scheme for mean curvature flow.
method Time discretization using Merriman, Bence and Osher's scheme, focusing on two-phase mean convex settings.
result Time-integrated energy of approximation converges to limit's energy in minimizing movements interpretation.

Proposes MD-LiNA for multi-domain latent factor causal discovery.

problem Discovering causal structures among latent factors from multi-domain data.
method Multi-Domain Linear Non-Gaussian Acyclic Models (MD-LiNA) with an integrated two-phase algorithm.
result Locally consistent estimators of causal structure among shared latent factors.

We examine the out-of-equilibrium phase reported by Plerou {\it et. al.} in Nature, {\bf 421}, 130 (2003) using the data of the New York stock market (NYSE) between the years 2001 --2002. We find that the observed two phase phenomenon is an artifact of the definition of the control parameter coupled with the nature of …

2005-02-15abs ↗pdf ↗

For better classification generative models are used to initialize the model and model features before training a classifier. Typically it is needed to solve separate unsupervised and supervised learning problems. Generative restricted Boltzmann machines and deep belief networks are widely used for unsupervised learnin…

2018-04-25abs ↗pdf ↗

A two-phase algorithm identifies the best arm in sparse linear bandits with fixed budget.

problem Best arm identification in sparse linear bandits with limited budget.
method Lasso and Optimal-Design (Lasso-OD) based linear best-arm identification.
result Lasso-OD achieves significant performance improvement for sparse and high-dimensional linear bandits.

The two phase behavior in financial markets actually means the bifurcation phenomenon, which represents the change of the conditional probability from an unimodal to a bimodal distribution. In this paper, the bifurcation phenomenon in Hang-Seng index is carefully investigated. It is observed that the bifurcation phenom…

2007-12-30abs ↗pdf ↗

Proposes a novel MTL approach based on bias-variance analysis.

problem Improving multi-task learning performance through shared knowledge.
method Two-phase iterative aggregation of targets and features using bias-variance analysis.
result Validation on synthetic and real-world datasets demonstrates the effectiveness of the proposed method.

We propose the Insertion-Deletion Transformer, a novel transformer-based neural architecture and training method for sequence generation. The model consists of two phases that are executed iteratively, 1) an insertion phase and 2) a deletion phase. The insertion phase parameterizes a distribution of insertions on the c…

2020-01-15abs ↗pdf ↗

Reliable training of generative adversarial networks (GANs) typically require massive datasets in order to model complicated distributions. However, in several applications, training samples obey invariances that are \textit{a priori} known; for example, in complex physics simulations, the training data obey universal …

2019-06-04abs ↗pdf ↗

We consider the problem of efficiently computing the maximum likelihood estimator in Generalized Linear Models (GLMs) when the number of observations is much larger than the number of coefficients (np1n \gg p \gg 1). In this regime, optimization algorithms can immensely benefit from approximate second order information.…

2015-11-28abs ↗pdf ↗

The biological plausibility of the backpropagation algorithm has long been doubted by neuroscientists. Two major reasons are that neurons would need to send two different types of signal in the forward and backward phases, and that pairs of neurons would need to communicate through symmetric bidirectional connections. …

2018-08-14abs ↗pdf ↗

MetaNOR learns common nonlocal kernels for efficient metamaterial modeling.

problem Efficiently modeling wave propagation in new metamaterials.
method Meta-learns a common nonlocal kernel from existing tasks and transfers this knowledge to new tasks with minimal data.
result Substantial improvements in sampling efficiency for new metamaterials.

Discrimination-aware classification is receiving an increasing attention in data science fields. The pre-process methods for constructing a discrimination-free classifier first remove discrimination from the training data, and then learn the classifier from the cleaned data. However, they lack a theoretical guarantee f…

2017-02-28abs ↗pdf ↗

DP-SGD can update fewer coordinates while maintaining privacy.

problem How to update fewer coordinates in DP-SGD without losing optimization signal.
method TP-TopK (Two-Phase TopK DP-SGD), a two-phase method for coordinate-sparse private training.
result Private training can update fewer coordinates without losing optimization signal, scaling noise with active dimension \(k\) instead of full dimension \(d\).

Efficiently estimates hub graphical models with structured sparsity.

problem Computational difficulty in fitting graphical models with hub nodes, especially in high-dimensional data.
method Two-phase algorithm: ADMM for initial point generation and SSN-ALM for accurate solution.
result Significantly improves estimation accuracy and efficiency compared to existing methods.

We discuss a class of (local and non-local) theories of gravity that share same properties: i) they admit the Einstein spacetime with arbitrary cosmological constant as a solution; ii) the on-shell action of such a theory vanishes and iii) any (cosmological or black hole) horizon in the Einstein spacetime with a positi…

2012-03-13abs ↗pdf ↗

New method improves statistical inference using machine learning-imputed data.

problem Improving statistical inference with imputed data from machine learning.
method Two-phase sampling approach for Z-estimation with ML-imputed outcomes.
result Guaranteed efficiency matching or exceeding classical inference, regardless of prediction quality.

Study uses DRL with Lagrangian relaxation to solve temporal control tasks with STL constraints.

problem Optimal control problems with temporal logic constraints.
method Extended CMDP formulation, Lagrangian relaxation, two-phase constrained DRL algorithm.
result Demonstrated learning performance of the proposed algorithm through simulations.

DR-submodular continuous functions are important objectives with wide real-world applications spanning MAP inference in determinantal point processes (DPPs), and mean-field inference for probabilistic submodular models, amongst others. DR-submodularity captures a subclass of non-convex functions that enables both exact…

2017-11-04abs ↗pdf ↗