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

Trend · papers per month

1223 · Nov 202519922001200920172026
48 results for post-selected teleportation

New framework for cyclic quantum causal models with graph separation property.

problem Understanding causal relationships in feedback processes and exotic scenarios.
method Introducing a robust probability rule and a novel graph-separation property, p-separation.
result Established graph-separation properties for all consistent cyclic causal models.

Develops a new framework for causal models on cyclic graphs, solving unique solvability issues.

problem Challenges in specifying unique probability distributions for cyclic functional causal models.
method Introduces a new probability rule and graph-separation property (p-separation) for cyclic fCMs.
result Proves p-separation is sound and complete for all consistent cyclic fCMs, recovering d-separation for DAGs.

Improves decentralized learning by teleporting active nodes for better convergence.

problem Decentralized learning's convergence rate degrades with large node numbers.
method Activates a subset of nodes, fetches parameters from previous active nodes, updates, and performs gossip averaging on a small topology.
result Teleportation completely alleviates convergence rate degradation with proper node activation.

The importance of nodes in a network constantly fluctuates based on changes in the network structure as well as changes in external interest. We propose an evolving teleportation adaptation of the PageRank method to capture how changes in external interest influence the importance of a node. This framework seamlessly g…

2012-03-27abs ↗pdf ↗

Here we prove the existence of a new type of the world-sheet string singularities - the cusps that are stable during the finite time. These singularities make the emission of the captured massive quantum particle possible in the frames of the author's model suggested earlier. In aggregate, we have a new mechanism of qu…

2017-05-29abs ↗pdf ↗

PS-DME evaluates model performance and reliability after data-dependent selection.

problem Evaluating model performance and reliability when data is used for selection and evaluation.
method Post-selection distributional model evaluation (PS-DME) using e-values to control false coverage rate.
result PS-DME provides reliable comparison of model configurations across different reliability levels.

We develop a general approach to valid inference after model selection. At the core of our framework is a result that characterizes the distribution of a post-selection estimator conditioned on the selection event. We specialize the approach to model selection by the lasso to form valid confidence intervals for the sel…

2013-11-25abs ↗pdf ↗

Develops methods to adjust prediction set coverage based on post-selection analysis.

problem Adjusting prediction set coverage after initial analysis to better fit specific needs.
method Post-selection conformal inference to adjust miscoverage levels.
result Allows for trade-off between coverage and prediction set quality.

While statistics and machine learning offers numerous methods for ensuring generalization, these methods often fail in the presence of adaptivity---the common practice in which the choice of analysis depends on previous interactions with the same dataset. A recent line of work has introduced powerful, general purpose a…

2018-06-15abs ↗pdf ↗

The paper discusses methods for interval estimation of coefficients in penalized regression models for insurance data.

problem Valid inference on coefficients after feature selection in GLM family for insurance data.
method Proposes methodologies for constructing confidence intervals of coefficients after feature selection in GLM family.
result Valid inference on coefficients after feature selection in GLM family for insurance data.

"Which Generative Adversarial Networks (GANs) generates the most plausible images?" has been a frequently asked question among researchers. To address this problem, we first propose an \emph{incomplete} U-statistics estimate of maximum mean discrepancy MMDinc\mathrm{MMD}_{inc} to measure the distribution discrepancy betwee…

2018-02-15abs ↗pdf ↗

We propose a novel kernel based post selection inference (PSI) algorithm, which can not only handle non-linearity in data but also structured output such as multi-dimensional and multi-label outputs. Specifically, we develop a PSI algorithm for independence measures, and propose the Hilbert-Schmidt Independence Criteri…

2016-10-12abs ↗pdf ↗

New algorithms for sampling in constrained domains without learning rates.

problem Sampling in constrained domains with fairness constraints and post-selection inference.
method Coin betting ideas from convex optimisation and a unifying framework for constrained sampling.
result Our algorithms achieve competitive performance without hyperparameter tuning.

A method to split a data point into two parts that individually cannot reconstruct the whole, but together can.

problem Splitting a single data point into two parts such that neither can reconstruct the whole but together can.
method Borrowing ideas from Bayesian inference to achieve a continuous analog of data splitting.
result A method to achieve data fission, enabling post-selection inference in finite samples.

Proposes MinPEN framework for estimating relationships in multivariate models.

problem Estimating relationships between multivariate outcomes in statistical learning.
method MinPEN framework using minimum function penalty for non-convex optimization.
result Theoretical and practical validation of MinPEN framework for multivariate models.

A decentralized online quantum cash system, called qBitcoin, is given. We design the system which has great benefits of quantization in the following sense. Firstly, quantum teleportation technology is used for coin transaction, which prevents from the owner of the coin keeping the original coin data even after sending…

2017-08-15abs ↗pdf ↗

ParPIC clusters directed graphs using random walks and diffusion operators.

problem Challenges in vertex-level clustering for directed graphs due to edge directionality.
method Parametrized Power-Iteration Clustering (ParPIC) based on reversible random walks and diffusion operators.
result ParPIC achieves competitive clustering accuracy with improved scalability compared to spectral and teleportation-based methods.

Finding statistically significant high-order interaction features in predictive modeling is important but challenging task. The difficulty lies in the fact that, for a recent applications with high-dimensional covariates, the number of possible high-order interaction features would be extremely large. Identifying stati…

2015-06-26abs ↗pdf ↗

Quantum game theory, whatever opinions may be held due to its abstract physical formalism, have already found various applications even outside the orthodox physics domain. In this paper we introduce the concept of a quantum auction, its advantages and drawbacks. Then we describe the models that have already been put f…

2007-09-26abs ↗pdf ↗

New method clusters directed and undirected graphs without losing directional information.

problem Clustering directed graphs due to asymmetry in edge connectivity.
method Generalized Dirichlet Energy (GDE) and generalized spectral clustering (GSC).
result GSC outperforms existing methods in clustering accuracy and robustness.

We address the problem of non-parametric multiple model comparison: given ll candidate models, decide whether each candidate is as good as the best one(s) or worse than it. We propose two statistical tests, each controlling a different notion of decision errors. The first test, building on the post selection inference…

2019-10-27abs ↗pdf ↗

We propose a statistical inference framework for the component-wise functional gradient descent algorithm (CFGD) under normality assumption for model errors, also known as L2L_2-Boosting. The CFGD is one of the most versatile tools to analyze data, because it scales well to high-dimensional data sets, allows for a very…

2018-05-04abs ↗pdf ↗

Study on estimating causal effects with limited data and multiple environments.

problem Estimating causal effects under hidden confounding with unpaired data and sparse effects.
method Instrumental variable (IV) regression with cross-fold sample splitting and 1\ell_1-regularized estimation.
result Proposed GMM-type estimator is consistent as the number of environments grows.

Ever since the proof of asymptotic normality of maximum likelihood estimator by Cramer (1946), it has been understood that a basic technique of the Taylor series expansion suffices for asymptotics of MM-estimators with smooth/differentiable loss function. Although the Taylor series expansion is a purely deterministic …

2018-09-13abs ↗pdf ↗

Machine learning can help us in solving problems in the context big data analysis and classification, as well as in playing complex games such as Go. But can it also be used to find novel protocols and algorithms for applications such as large-scale quantum communication? Here we show that machine learning can be used …

2019-04-24abs ↗pdf ↗

Refining one's hypotheses in the light of data is a common scientific practice; however, the dependency on the data introduces selection bias and can lead to specious statistical analysis. An approach for addressing this is via conditioning on the selection procedure to account for how we have used the data to generate…

2019-10-14abs ↗pdf ↗

Selective inference for group lasso estimators across various distributions and covariates.

problem Developing selective inference methods for group lasso estimators.
method Randomized group-regularized optimization problem with post-selection likelihood.
result Selective point estimator and Wald-type confidence regions for regression parameters.

In this paper, we provide efficient estimators and honest confidence bands for a variety of treatment effects including local average (LATE) and local quantile treatment effects (LQTE) in data-rich environments. We can handle very many control variables, endogenous receipt of treatment, heterogeneous treatment effects,…

2013-11-11abs ↗pdf ↗

DebiNet uses over-parameterized neural networks to improve linear model performance and debiasing.

problem Improving linear model performance and debiasing in high-dimensional settings.
method Incorporates over-parameterized neural networks into semi-parametric models to estimate parameters consistently.
result DebiNet offers valid inference and accurate prediction by leveraging neural networks' universal approximation and linear model's interpretability.

Reweighted ALPS improves sampling from multimodal distributions using warm start points.

problem Sampling from multimodal distributions is hard due to exponential mixing times.
method Introduces Reweighted ALPS, a modified Annealed Leap-Point Sampler that uses warm start points.
result First polynomial-time bound for Re-ALPS in a general setting, under a natural assumption.

DL/FBF improves GPSR solutions by selecting compact, generalising expressions.

problem Overfitting and structural bloat in symbolic regression with genetic programming.
method Description length (DL) and fractional Bayes factor (FBF) criteria for selecting compact, generalising expressions.
result DL/FBF post-selection improves test performance compared to AIC/BIC baseline.

Proposes DR-ME test for interpretable distributional treatment effects.

problem Detects invisible differences in treatment effects on distributional outcomes.
method Semiparametrically efficient finite-location test using kernel witnesses and orthogonal features.
result DR-ME reveals causal-discrepancy coordinates and has noncentral chi-square local power.