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

Trend · papers per month

0.3%0.5%0.8%0.3% · May 201319922001200920172026
27 results for MEC

MEC-IP uses IP to efficiently find MECs in BNs from observational data.

problem Discovering Markov Equivalent Classes (MECs) in Bayesian Networks (BNs) efficiently.
method Clique-focusing strategy and EMSG for MEC discovery via Integer Programming.
result Significant reduction in computational time and improved accuracy.

MEC improves efficiency and robustness in semi-supervised inference.

problem Efficient inference with limited labeled data and robust uncertainty quantification.
method Machine-Learning-Assisted Generalized Entropy Calibration (MEC) using cross-fitted, calibration-weighted PPI.
result MEC achieves semiparametric efficiency bounds under weaker assumptions and provides near-nominal coverage.

A fast algorithm for counting Markov equivalent DAGs and designing experiments.

problem Counting Markov equivalent DAGs and designing experiments efficiently.
method LazyIter algorithm for efficient iteration over MECs, utilizing intervention results.
result Significant reduction in time complexity for sparse graphs (O(n)).

MEC-Cox: A Machine-Learning-Assisted Generalized Entropy Calibration Method for Estimating ATT Marginal Hazard-Ratio

problem Estimating ATT marginal hazard-ratio in externally controlled survival trials
method Machine-learning-assisted generalized entropy calibration for IPW Cox regression
result Reduces bias, increases efficiency, and improves coverage

Directed acyclic graph (DAG) models are popular for capturing causal relationships. From observational and interventional data, a DAG model can only be determined up to its \emph{interventional Markov equivalence class} (I-MEC). We investigate the size of MECs for random DAG models generated by uniformly sampling and o…

2019-03-05abs ↗pdf ↗

This paper tackles risk-aware energy scheduling for MEC networks with microgrids.

problem Risk in energy demand and supply for MEC networks powered by microgrids.
method Formulated an optimization problem with CVaR for energy consumption and generation, analyzed using a multi-agent stochastic game, derived solution with MADRL-based A3C algorithm.
result Significant performance gain by considering CVaR for high accuracy energy scheduling.

Characterizes Bayesian networks up to unconditional equivalence.

problem Characterizing Bayesian networks up to unconditional equivalence.
method Transformational characterization via undirected graphs and specified moves.
result Two DAGs are in the same UEC if and only if one can be transformed into the other via a finite sequence of moves.

New method tests causal relationships from data without needing to learn the entire graph.

problem Testing if a causal graph belongs to a specific Markov equivalence class from observational data.
method Established bounds on the number of independence tests required and provided an algorithm that matches these bounds.
result Testing requires exponentially less independence tests compared to learning, especially in graphs with high in-degrees and small clique sizes.

This work sets a universal lower bound for learning causal DAGs with atomic interventions.

problem Learning causal DAGs using only observational data results in a Markov equivalence class, requiring interventions to fully orient.
method Developed CBSP orderings and used them to prove a universal lower bound on the number of single-node interventions needed.
result The universal lower bound is within a factor of two of the minimum number of single-node interventions required to fully orient a given Markov equivalence class.

Deep learning approach for efficient IoT task scheduling in MEC networks.

problem Minimizing task latency in IoT users with large-scale MEC systems.
method Stacked auto-encoder for data compression, adaptive simulated annealing, experience replay.
result Near-optimal performance with significantly reduced computational time.

Paper proposes MAMRL for efficient energy dispatch in self-powered edge computing systems.

problem High energy consumption in self-powered edge computing systems.
method Developed a semi-distributed data-driven MAMRL framework to solve a two-stage linear stochastic programming problem.
result The proposed MAMRL framework reduces up to 11% non-renewable energy usage and 22.4% energy cost.

CodedFedL speeds up federated learning in MEC networks by 15x.

problem Slow convergence in federated learning due to heterogeneity and stochastic fluctuations.
method Injects structured coding redundancy into federated learning to mitigate stragglers and speed up training.
result CodedFedL speeds up the training procedure by up to 15x compared to benchmark schemes.

A new method for efficient causal structure learning at scale.

problem Causal structure learning is computationally challenging at scale.
method Relaxed sparsest-permutation formulation with support-level relaxation and masked zero-fill incomplete Cholesky factorization.
result The method enables scalable comparison of candidate orderings and matches the accuracy of slower baselines.

Coded Federated Learning speeds up training in edge computing networks.

problem Slow convergence in Federated Learning due to heterogeneity and stochastic fluctuations.
method Exploiting statistical properties of compute and communication delays, distributed kernel embedding, and random Fourier features.
result Significant performance gains for CodedFedL in distributed non-linear regression and classification problems.

Scheduling and power allocation improve federated learning efficiency in NOMA networks.

problem Efficiently scheduling and allocating power for federated learning in bandwidth-limited wireless networks.
method Proposed a scheduling policy and power allocation scheme using NOMA to maximize data rate and convergence speed.
result Simulation results show improved federated learning accuracy in NOMA networks.

Hexagon grid patterns emerge from conformal isometry in grid cell neural networks.

problem Understanding the algebraic, geometric, and topological properties of grid cells.
method Investigating recurrent neural network models of grid cells, focusing on Lie group and Lie algebra representations, conformal isometry, and hexagon periodic patterns.
result Conformal isometry leads to hexagon periodic patterns in grid cell responses and accurate path integration.

We consider the problem Pcurve\mathbf{P_{curve}} of minimizing 0Lξ2+κ2(s)ds\int \limits_0^L \sqrt{ξ^2 + κ^2(s)} \, {\rm d}s for a curve x\mathbf{x} on R\mathbb R with fixed boundary points and directions. Here the total length L0L\geq 0 is free, ss denotes the arclength parameter, κκ denotes the absolute curvature of $\mathbf{x}…

2013-05-26abs ↗pdf ↗

Federated learning optimizes task and resource allocation in balloon networks.

problem Minimizing energy and time consumption in task computation and transmission.
method SVM-based federated learning algorithm to dynamically adjust user associations, service sequences, and task allocations.
result Reduces the weighted sum of energy and time consumption by up to 16.1%.