Real-time prediction of SLA violations in telecom services.
problem Detecting and predicting SLA violations in dynamic telecom environments.
method Online machine learning approach using streaming device-level metrics.
result Highly accurate predictions (>90% classification accuracy and < 10% false alarm rate).
SLAs improve decadal climate predictions by reducing forecast errors.
problem Improving climate predictions and reducing associated uncertainties.
method Used sequential learning algorithms to reduce forecast errors in four climate variables.
result One SLA outperformed equally weighted ensemble, linear regression, and climatology.
A new algorithm SLA reduces bias in sampling from measures using Langevin dynamics.
problem Reducing bias in sampling from complex target measures using Langevin dynamics.
method Proposed symmetrized Langevin algorithm (SLA) to correct bias in ULA.
result SLA is consistent for Gaussian target measures, while ULA is not.
A fast, accurate method for estimating extreme quantiles in insurance and operational risk models.
problem Estimating extreme quantiles of compound loss distributions in insurance and operational risk models.
method Interpolated Single Loss Approximation (ISLA) and modified ISLA (MISLA).
result MISLA is comparable in speed and accuracy to the best competing method (PE2) and is easier to implement.
Optimizes resource allocation for virtualized network functions based on performance profiles.
problem Mapping SLA performance requirements to dynamic virtualized infrastructure resources.
method Profile-based resource allocation using VNF performance datasets and machine learning models.
result A method to predict and recommend optimal resource allocation for network services.
A neural network, IHT-Net, improves DOA estimation with sparse arrays.
problem Single-snapshot DOA estimation with sparse arrays in dynamic settings.
method IHT-inspired neural network with recurrent neural network and autoencoders.
result IHT-Net achieves faster convergence and higher accuracy in DOA estimation.
This review summarizes five Lasso optimization algorithms.
problem Optimizing the Lasso objective function.
method Five representative algorithms: ISTA, FISTA, CGDA, SLA, PFA.
result Comparison of convergence rates and strengths/weaknesses.
Study connects Riemann-Finsler geometry to Lorentz-violating scalar fields.
problem Exploring the connection between Riemann-Finsler geometries and Lorentz-violating scalar fields.
method Deriving quadratic actions and classical relativistic point-particle lagrangians in various spacetime dimensions.
result Support for open conjectures about Riemann-Finsler geometries in Lorentz-violating field theories.
A method uses decision trees to detect and characterize positivity violations in causal inference.
problem Detecting and characterizing positivity violations in causal inference datasets.
method Decision trees dividing covariate space into regions for automatic detection of subspaces violating positivity.
result Scalable and interpretable characterization of subspaces with positivity violations.
Bayesian methods detect significant IIA violations in similarity choice data.
problem Detecting IIA violations in similarity choice data complicates classical models.
method Proposed two statistical methods: classical goodness-of-fit test and Bayesian PPC.
result Significant IIA violations confirmed in both datasets, driven by context effects.
Improved online convex optimization with long-term constraints achieving low regret and constraint violations.
problem Online convex optimization with long-term constraints over complicated sets.
method A new simple algorithm achieving O ( T ) O(\sqrt{T}) O ( T ) regret and O ( 1 ) O(1) O ( 1 ) constraint violations. result Improved performance with O ( T ) O(\sqrt{T}) O ( T ) regret and O ( 1 ) O(1) O ( 1 ) constraint violations. New method assesses neural network robustness with statistical estimates.
problem Assessing neural network robustness under input models.
method Statistical approach based on estimating the proportion of inputs violating a property.
result Provides an informative notion of network robustness, scaling to larger networks.
This contribution to the CPT'13 meeting briefly introduces Lorentz and CPT violation and outlines two recent developments in the field.
Bipartite Riemann-Finsler geometries with complementary Finsler structures are constructed. Calculable examples are presented based on a bilinear-form coefficient for explicit Lorentz violation.
Paper improves DOA estimation in sparse arrays using Siamese neural networks.
problem Challenges in DOA estimation with limited snapshots in sparse linear arrays.
method Introduces a Siamese neural network with a sparse augmentation layer for enhanced signal feature embedding.
result Demonstrates improved DOA estimation accuracy in sparse arrays.
Combines ocean surface and interior data to study ocean dynamics.
problem Modeling local ocean currents and global climate patterns.
method Observation-driven framework using Latent-class regression.
result Improved prediction of vertical ocean temperature.
CVTMLE improves statistical inference in settings of positivity or Donsker class violations.
problem Inference issues in causal inference due to data sparsity or near-positivity violations.
method Cross-validation of TMLE (CVTMLE) to improve performance in settings of positivity or Donsker class violations.
result CVTMLE vastly improves confidence interval coverage without affecting bias, especially in small sample sizes and near-positivity violations.
New algorithm reduces sample complexity for safe reinforcement learning.
problem Safe reinforcement learning in constrained MDPs with performance and safety constraints.
method Model-based primal-dual algorithm balancing regret and bounded constraint violations.
result Proves near-optimal policies with bounded violations or zero violations in CMDPs.
The study proves strong cosmic censorship violation for spherically symmetric dust clouds.
problem Violation of strong cosmic censorship for spherically symmetric dust clouds.
method Derived an ordinary differential equation for light rays and used it to prove strong cosmic censorship violation.
result Generic violation of strong cosmic censorship for spherically symmetric dust clouds.
We show that any open subset of a contact manifold of dimension greater than three contains a certain non-convex hypersurface violating the Thurston-Bennequin inequality.
NucleusDiff models atomic nuclei interactions to prevent separation violations in drug design.
problem Maintaining minimum pairwise distance between atoms to avoid separation violations in drug design.
method Enforces distance constraint between atomic nuclei and manifolds in a diffusion model.
result Reduces separation violations by up to 100.00% and enhances binding affinity by up to 22.16%.
New algorithm reduces regret and constraint violation in online convex optimization with complex constraints.
problem Online convex optimization with multiple functional constraints and a simple constraint set.
method Instance-dependent bound using online primal-dual mirror-prox algorithm in general normed spaces.
result Achieves an O(√V*(T)) regret and O(1) constraint violation, improving over previous works.
Optimistic algorithm reduces regret and constraint violations in online convex optimization with adversarial constraints.
problem Online convex optimization with adversarial constraints.
method Improved algorithm using accurate predictions of loss and constraint functions.
result Improved bounds on regret and cumulative constraint violations.
Algorithm minimizes loss and constraint violations in online convex optimization with smooth penalties.
problem Minimizing loss and constraint violations in online convex optimization with smooth penalties.
method Projected gradient descent over a set around the current action.
result Both dynamic regret and constraint violation are bounded by the path-length.
CausalCompass evaluates TSCD robustness under violations of modeling assumptions.
problem Widespread adoption of TSCD is hindered by untestable causal assumptions and lack of robustness evaluation.
method CausalCompass is a flexible benchmark framework for assessing TSCD robustness under violations of modeling assumptions.
result No single method consistently attains optimal performance across all settings, but deep learning-based methods perform well.
Paper tackles constrained bandit problems with a new learning framework.
problem Optimizing a black-box reward function subject to a black-box constraint function over a continuous space.
method Rectified Pessimistic-Optimistic Learning (RPOL) framework, incorporating optimistic and pessimistic GP bandit learning.
result RPOL achieves sublinear regret and minimal cumulative constraint violation.
Causality violations are typically seen as unrealistic and undesirable features of a physical model. The following points out three reasons why causality violations, which Bonnor and Steadman identified even in solutions to the Einstein equation referring to ordinary laboratory situations, are not necessarily undesirab…
Measures policy-violating content prevalence with ML-assisted sampling and LLM labeling.
problem Accurate measurement of content violations that are often rare and costly to label.
method Design-based measurement system using ML-assisted probability sampling and LLM labeling.
result Produces unbiased prevalence estimates with confidence intervals and dashboard drilldowns.
This paper detects Markov violations in RL with noise, improving policy development.
problem Partial observability and sensor/actuator noise invalidate Markovian assumptions in RL.
method Combines PCMCI causal discovery with Markov Violation score (MVS).
result Even substantial noise doesn't always disrupt multi-step dependencies.
A scoring method for driving safety using trajectory data.
problem Managing traffic safety through driver behaviors and violations.
method Extract driving habits and violations from trajectories, train a model, score drivers.
result Proves the effectiveness of the scoring method using traffic simulation.
Pioneers a new network slicing solution for beyond-5G networks.
problem Ensuring diverse service level agreements (SLAs) in a multi-tenant environment with varying latency and throughput requirements.
method Leverages a multi-armed-bandit-based (MAB) orchestrator, LACO, that makes adaptive resource slicing decisions based on system structure information.
result Near-optimal results in resource slicing decisions with no prior knowledge of traffic demand or channel quality statistics.
A new method tests Expected Shortfall by analyzing both duration and severity of VaR violations.
problem Lack of separate testing for frequency and severity in ES backtesting.
method Uses bivariate orthogonal polynomials to derive moment conditions for durations and severities.
result Proposes a Wald test for identifying mis-specified components in ES models.
Paper addresses distributed optimization with time-varying constraints.
problem Distributed online optimization with time-varying coupled inequality constraints.
method Proposes a distributed online primal-dual dynamic mirror descent algorithm.
result Achieves sublinear dynamic regret and constraint violation under natural stepsize sequences.
Effective field theories with explicit Lorentz violation are intimately linked to Riemann-Finsler geometry. The quadratic single-fermion restriction of the Standard-Model Extension provides a rich source of pseudo-Riemann-Finsler spacetimes and Riemann-Finsler spaces. An example is presented that is constructed from a …
Quantum theory challenges traditional cause-effect relations, showing causal influences even without Bell inequality violations.
problem Challenging traditional concepts of cause-effect relations in quantum mechanics.
method Introducing a general framework to estimate causal influences without interventions or classical/quantum assumptions.
result Every pure bipartite entangled state violates classical bounds on causal influence, negating the idea that Bell inequalities are the only signature of incompatibility.
New method speeds up optimization with non-uniform sampling.
problem Optimizing complex stochastic problems efficiently.
method Stochastic Primal Dual Coordinate Method with Optimality Violation-based Sampling.
result The proposed method and variants outperform other methods in speed.
Our work investigates how to identify privacy violations in models using finite adversaries.
problem Identifying privacy violations in models with limited adversary capabilities.
method Investigates requirements for finite adversaries to identify privacy violations.
result Parameters quantify the capabilities of finite adversaries.
Neural network ensembles predict design rule violations from early stages of IC design.
problem Predicting design rule violations from placement and global routing stages in IC design.
method Proposes a framework using neural network ensembles with soft voting and PCA-based subset selection.
result Significant improvement in model performance compared to baseline, including better performance than random forest.
TMLE improves causal effect estimation in missing data scenarios with various positivity violations.
problem Estimating causal effects in studies with missing data and positivity violations.
method Targeted Maximum Likelihood Estimation (TMLE) with various missing data methods.
result Complete cases with TMLE incorporating an outcome-missingness model exhibit lower bias and greater robustness against positivity violations.
Certain momentum-dependent terms in the fermion sector of the Lorentz-violating Standard Model Extension (SME) yield solvable classical lagrangians of a type not mentioned in the literature. These cases yield new relatively simple examples of Finsler and pseudo-Finsler structures. One of the cases involves antisymmetri…
Machine learning forecasts show bias at long horizons, contrary to standard tests.
problem Forecast efficiency tests misinterpret machine learning performance.
method Theoretical and empirical analysis of regularization and measurement noise.
result Machine learning forecasts exhibit overreaction at longer horizons, not bias.
The physics of classical particles in a Lorentz-breaking spacetime has numerous features resembling the properties of Finsler geometry. In particular, the Lagrange function plays a role similar to that of a Finsler structure function. A summary is presented of recent results, including new calculable Finsler structures…
Differentiable causal discovery methods perform robustly under model violations.
problem Causal discovery algorithms struggle with real-world data due to unverifiable causal assumptions.
method Benchmarked differentiable causal discovery methods under eight model assumption violations.
result Differentiable causal discovery methods exhibit robust performance under Structural Hamming Distance and Structural Intervention Distance metrics.
New RL algorithm achieves sublinear regret and constraint violation without simulators.
problem Maximizing reward under utility constraints in large-scale systems.
method Model-free, simulator-free algorithm using LSVI-UCB with primal-dual optimization and soft-max policy.
result Achieves i l d e O ( d 3 H 3 T ) ilde{\mathcal{O}}(\sqrt{d^3H^3T}) i l d e O ( d 3 H 3 T ) regret and i l d e O ( d 3 H 3 T ) ilde{\mathcal{O}}(\sqrt{d^3H^3T}) i l d e O ( d 3 H 3 T ) constraint violation bounds. LinConTS improves regret and constraint violations in probabilistic linearly constrained bandits.
problem Maximizing cumulative reward under probabilistic linear constraints.
method LinConTS, a Thompson Sampling-based algorithm for bandits with linear constraints.
result LinConTS achieves O(log T) regret and constraint violations for suboptimal arms.
Some high-dimensional data.sets can be modelled by assuming that there are many different linear constraints, each of which is Frequently Approximately Satisfied (FAS) by the data. The probability of a data vector under the model is then proportional to the product of the probabilities of its constraint violations. We …
New methods reduce constraint violations to certainty in stochastic optimization.
problem Finding a point with certain constraint satisfaction and near-stationarity.
method Single-loop variance-reduced stochastic first-order methods with truncated momentum schemes.
result Achieves strong convergence guarantees for ε ε ε -stochastic stationary points with certain constraint satisfaction. The paper addresses causal estimation for text data with apparent overlap violations.
problem Estimating causal effects from text data with unknown confounders and apparent overlap.
method Uses supervised representation learning to create a representation that preserves confounding information while eliminating predictive information, satisfying overlap assumptions.
result Shows how to obtain robust causal estimation in the presence of apparent overlap violations.