resolution
- Information Technology > Artificial Intelligence (0.69)
- Information Technology > Communications > Mobile (0.47)
Hands on: Windows' DLSS rival isn't ready to save handheld gaming
PCWorld tested Microsoft's Auto SR, a DLSS rival exclusive to the Asus ROG Ally X, finding it delivers only marginal 10% performance gains in games like Borderlands 3. The technology currently works only in docked mode at 720p resolution and produces notably degraded visuals described as'muddy' and'swimmy' compared to native resolution. Auto SR remains in Preview status with significant usability issues including incorrect scaling and required game restarts, making it inadequate for handheld gaming improvement. Last week Microsoft announced the arrival of Auto SR, its Windows-branded alternative to upscaling tech like DLSS, with great fanfare. After being semi-exclusive to Snapdragon laptops, it came to the Asus ROG Xbox Ally X and nothing else. Not even the non-X variant, since it needs an NPU to run. And also it only works in docked mode, not handheld mode.
- Leisure & Entertainment > Games > Computer Games (1.00)
- Information Technology (1.00)
- Information Technology > Artificial Intelligence (1.00)
- Information Technology > Hardware (0.87)
- Information Technology > Communications > Networks (0.31)
LAUSD to vote on restricting student screen time, after years of encouraging classroom use
Things to Do in L.A. Tap to enable a layout that focuses on the article. Students with computers participate in a summer program at Canoga Park High School in 2022. This is read by an automated voice. Please report any issues or inconsistencies here . Los Angeles Unified is poised to reverse years of promoting classroom technology with restrictions on student screen time.
- North America > United States > California > Los Angeles County > Los Angeles (0.73)
- North America > United States > California > Los Angeles County > Burbank (0.04)
- North America > United States > California > Los Angeles County > Beverly Hills (0.04)
- (2 more...)
- Health & Medicine > Therapeutic Area (0.95)
- Government (0.84)
- Education > Educational Setting > K-12 Education > Primary School (0.30)
U-Cast: A Surprisingly Simple and Efficient Frontier Probabilistic AI Weather Forecaster
Cachay, Salva Rühling, Watson-Parris, Duncan, Yu, Rose
AI-based weather forecasting now rivals traditional physics-based ensembles, but state-of-the-art (SOTA) models rely on specialized architectures and massive computational budgets, creating a high barrier to entry. We demonstrate that such complexity is unnecessary for frontier performance. We introduce U-Cast, a probabilistic forecaster built on a standard U-Net backbone trained with a simple recipe: deterministic pre-training on Mean Absolute Error followed by short probabilistic fine-tuning on the Continuous Ranked Probability Score (CRPS) using Monte Carlo Dropout for stochasticity. As a result, our model matches or exceeds the probabilistic skill of GenCast and IFS ENS at 1.5$^\circ\$ resolution while reducing training compute by over 10$\times$ compared to leading CRPS-based models and inference latency by over 10$\times$ compared to diffusion-based models. U-Cast trains in under 12 H200 GPU-days and generates a 60-step ensemble forecast in 11 seconds. These results suggest that scalable, general-purpose architectures paired with efficient training curricula can match complex domain-specific designs at a fraction of the cost, opening the training of frontier probabilistic weather models to the broader community. Our code is available at: https://github.com/Rose-STL-Lab/u-cast.
- North America > United States (0.14)
- Asia > Middle East > Jordan (0.04)
Decomposing Probabilistic Scores: Reliability, Information Loss and Uncertainty
Charpentier, Arthur, Machado, Agathe Fernandes
Calibration is a conditional property that depends on the information retained by a predictor. We develop decomposition identities for arbitrary proper losses that make this dependence explicit. At any information level $\mathcal A$, the expected loss of an $\mathcal A$-measurable predictor splits into a proper-regret (reliability) term and a conditional entropy (residual uncertainty) term. For nested levels $\mathcal A\subseteq\mathcal B$, a chain decomposition quantifies the information gain from $\mathcal A$ to $\mathcal B$. Applied to classification with features $\boldsymbol{X}$ and score $S=s(\boldsymbol{X})$, this yields a three-term identity: miscalibration, a {\em grouping} term measuring information loss from $\boldsymbol{X}$ to $S$, and irreducible uncertainty at the feature level. We leverage the framework to analyze post-hoc recalibration, aggregation of calibrated models, and stagewise/boosting constructions, with explicit forms for Brier and log-loss.
- Asia > Middle East > Jordan (0.04)
- North America > United States > New York (0.04)
- North America > Canada (0.04)
- Asia > Japan (0.04)
Information-driven design of imaging systems
Our information estimator uses only these noisy measurements and a noise model to quantify how well measurements distinguish objects. Many imaging systems produce measurements that humans never see or cannot interpret directly. Your smartphone processes raw sensor data through algorithms before producing the final photo. MRI scanners collect frequency-space measurements that require reconstruction before doctors can view them. Self-driving cars process camera and LiDAR data directly with neural networks.
- North America > United States > Oregon (0.05)
- Europe > Netherlands > North Holland > Amsterdam (0.05)
- Asia > Singapore (0.05)
Learning Abstract Options
Building systems that autonomously create temporal abstractions from data is a key challenge in scaling learning and planning in reinforcement learning. One popular approach for addressing this challenge is the options framework (Sutton et al., 1999). However, only recently in (Bacon et al., 2017) was a policy gradient theorem derived for online learning of general purpose options in an end to end fashion. In this work, we extend previous work on this topic that only focuses on learning a two-level hierarchy including options and primitive actions to enable learning simultaneously at multiple resolutions in time. We achieve this by considering an arbitrarily deep hierarchy of options where high level temporally extended options are composed of lower level options with finer resolutions in time. We extend results from (Bacon et al., 2017) and derive policy gradient theorems for a deep hierarchy of options. Our proposed hierarchical option-critic architecture is capable of learning internal policies, termination conditions, and hierarchical compositions over options without the need for any intrinsic rewards or subgoals. Our empirical results in both discrete and continuous environments demonstrate the efficiency of our framework.
FishNet: A Versatile Backbone for Image, Region, and Pixel Level Prediction
The basic principles in designing convolutional neural network (CNN) structures for predicting objects on different levels, e.g., image-level, region-level, and pixel-level, are diverging. Generally, network structures designed specifically for image classification are directly used as default backbone structure for other tasks including detection and segmentation, but there is seldom backbone structure designed under the consideration of unifying the advantages of networks designed for pixel-level or region-level predicting tasks, which may require very deep features with high resolution. Towards this goal, we design a fish-like network, called FishNet. In FishNet, the information of all resolutions is preserved and refined for the final task. Besides, we observe that existing works still cannot \emph{directly} propagate the gradient information from deep layers to shallow layers. Our design can better handle this problem. Extensive experiments have been conducted to demonstrate the remarkable performance of the FishNet. In particular, on ImageNet-1k, the accuracy of FishNet is able to surpass the performance of DenseNet and ResNet with fewer parameters. FishNet was applied as one of the modules in the winning entry of the COCO Detection 2018 challenge.
Joint Sub-bands Learning with Clique Structures for Wavelet Domain Super-Resolution
Convolutional neural networks (CNNs) have recently achieved great success in single-image super-resolution (SISR). However, these methods tend to produce over-smoothed outputs and miss some textural details. To solve these problems, we propose the Super-Resolution CliqueNet (SRCliqueNet) to reconstruct the high resolution (HR) image with better textural details in the wavelet domain. The proposed SRCliqueNet firstly extracts a set of feature maps from the low resolution (LR) image by the clique blocks group. Then we send the set of feature maps to the clique up-sampling module to reconstruct the HR image. The clique up-sampling module consists of four sub-nets which predict the high resolution wavelet coefficients of four sub-bands. Since we consider the edge feature properties of four sub-bands, the four sub-nets are connected to the others so that they can learn the coefficients of four sub-bands jointly. Finally we apply inverse discrete wavelet transform (IDWT) to the output of four sub-nets at the end of the clique up-sampling module to increase the resolution and reconstruct the HR image. Extensive quantitative and qualitative experiments on benchmark datasets show that our method achieves superior performance over the state-of-the-art methods.
- North America > Canada (0.04)
- Europe > France (0.04)